DIMACS Workshop on Current Trends in Cryptology

April 29 - May 1, 2013
AT & T Building
33 Thomas Street
New York City, New York

Organizers:

David Cash, Rutgers University, david.cash at cs.rutgers.edu

Martijn Stam, University of Bristol, Martijn.Stam at bristol.ac.uk

Yevgeniy Vahlis, AT&T Security Research Center, evahlis at att.com

Workshop Program:

Monday, April 29, 2013	

 8:45 -  9:15  Breakfast & Registration

 9:15 -  9:30  Rebecca Wright, DIMACS - Director's Welcome

 9:30 - 10:00  Dynamic Proofs of Retrievability via Oblivious RAM	
               Daniel Wichs, Northeastern

10:00 - 10:30  Fully Homomorphic Message Authenticators
               Rosario Gennaro, CCNY

10:30 - 11:00  Coffee Break

11:00 - 11:30  Message-Locked Encryption and Secure Deduplication	
               Thomas Ristenpart, U Wisconsin	

11:30 - 12:30  Key Derivation Without Entropy Waste
               Yevgeniy Dodis, NYU		

12:30 -  2:00  Lunch

 2:00 -  2:30  Candidate Constructions for Functional Encryption and Best Possible Obfuscation	
               Craig Gentry, IBM	

 2:30 -  3:00  Attribute-Based Encryption for Circuits	
               Hoeteck Wee, George Washington U	

 3:00 -  3:30  Reusable Garbled Circuits and Succinct Functional Encryption	
               Yael Kalai, MSR

 3:30 -  4:00  Coffee Break

 4:00 -  4:30  Interactive Coding, Revisited	
               Rafael Pass, Cornell

 4:30 -  5:00  Controlled Malleability for NIZK and Signatures: Definitions, Constructions and Applications	
               Anna Lysyanskaya, Brown
 
 5:00 -  5:30  Legal Challenges of Addressing Computer Insecurity While
               Protecting Privacy and Free Expression, Or 'Why Aren't We Using These Crypto Tools?'
               Timothy Edgar, Brown	
		
Tuesday, April 30, 2013	
		
 9:00 -  9:30  Breakfast & Registration
 
 9:30 - 10:00  Concurrently Secure Computation in the Multiple Ideal Query Model	
               Abhishek Jain, Boston University/MIT

10:00 - 10:30  Constant-Round Concurrent Zero Knowledge From P-Certificates	
               Huija R. Lin, Boston University/MIT

10:30 - 11:00  Coffee Break

11:00 - 12:00  Searchable Encryption in the Real World: Theory and Practice	
               Hugo Krawczyk, IBM

12:00 - 12:30  Scalable Private Database Querying for Arbitrary Formulas	
               Vlad Kolesnikov, Bell Labs

12:30 -  2:00  Lunch

 2:00 -  2:30  Broadcast Steganography	
               Nelly Fazio, CCNY

 2:30 -  3:00  Inchworm: Secure Computation, One Step at a Time	
               Tal Moran, IDC, Israel

 3:00 -  3:30  Hard Learning Problems Over Non-Commutative Groups	
               Antonion Nicolosi, Stevens	

 3:30 -  4:00  Coffee Break

 4:00 -  4:30  Decision Procedures for Simulatability	
               Charanjit Jutla, IBM

 4:30 -  5:00  The Garden-Hose Model	
               Christian Schaffner, U Amsterdam

 5:00 -  5:30  Crypto at the Age of Extreme Attacks
               Moti Yung, Google
		
Wednesday, May 1, 2013	

 9:00 -  9:30  Breakfast & Registration

 9:30 - 10:00  A Full Characterization of Completeness for Two-party Randomized Function Evaluation	
               Manoj Prabakharan, UIUC

10:00 - 10:30  Rational Protocol Design: Cryptographic Security Against Incentive-driven Attacks	
               Vassilis Zikas, UCLA

10:30 - 11:00  Coffee Break

11:00 - 11:30  Christian Rechberger, DTU, Denmark - TBA

11:30 - 12:30  SHA3: Where We've Been and Where We're Going
               Bill Burr, NIST

12:30 -  2:00  Lunch

 2:00 -  2:30  Anonymous yet Authentic: Secure Multiparty Computation in the Two-Tier Trust Model	
               Aggelos Kiayias, U Athens

 2:30 -  3:00  Secure Computation on Sparse Networks in the Presence of Malicious Nodes and Edges	
               Nishanth Chandran, AT&T	

 3:00 -  3:30  Multi-Party Computation of Polynomials and Branching Programs without Simultaneous Interaction	 
               Tal Malkin, Columbia

 3:30 -  4:00  Coffee Break
 
 4:00 -  4:30  On the (Im)Possibility of Tamper-Resilient Cryptography	
               Mohammad Mahmoody, Cornell
 
 4:30 -  5:00  Can Theories be Tested? A Cryptographic Treatment of Forecast Testing	
               Kai-Min Chung, Cornell

 5:00 -  5:30  Coupled-Worlds Privacy: Exploiting Adversarial Uncertainty in Statistical Data Privacy	
               Adam Smith, Penn State
 
 5:30 -  7:00  Farewell Cocktail at Anotheroom (249 W Broadway)
		
 

Previous: Participation

Next: Registration

Workshop Index

DIMACS Homepage