• Homepage
• Call for Papers
• Committees
• Paper Submission
• Accepted Papers
• Program Schedule
• Invited Talks
• Tutorials
• Registration
• Visa Information
• Travel Information
• Accomodation
• Other Information

Tutorial

Date

Venue

Speakers

• Mike Rosulek, Oregon State, USA.
  Session 1 & 2
  
  Title: Garbled circuits for secure computation
  
  
  Abstract: Garbled circuits are the oldest technique for secure two-party computation (2PC), and remain a popular primitive in many areas of cryptography. This tutorial will cover the state-of-the-art in garbled circuit constructions and applications within 2PC, including recent advances in garbling for boolean & arithmetic circuits, applications to zero-knowledge proofs, and methods for distributed/authenticated garbling for added security guarantees.
  
  Bio: Mike Rosulek is an Assistant Professor in the School of EECS at Oregon State University. He holds a Ph.D. in Computer Science from the University of Illinois and a B.S. in Computer Science from Iowa State University. His research interests are in cryptography, focusing on theoretical and practical aspects of secure multiparty computation protocols. His research has been recognized with an NSF CAREER award, a Google Faculty Research award, and a Visa Research Faculty award.


• Muthuramakrishnan Venkitasubramaniam, University of Rochester, USA.
  Session 1
  
  Title: Blockchains and its promises for the future
  
  
  Abstract: Blockchains are distributed ledgers that are becoming increasingly popular as efficient, reliable, and persistent records of data. The rise of cryptocurrencies has stimulated excitement in large-scale deployments of blockchains across thousands of nodes and hundreds of nodes. In this tutorial, I will introduce blockchains from a distributed computing point of view and describe the limits of achieving scalable consensus in the so-called permission-less setting. I will survey recent results and present some open problems.
  
  Session 2
  
  Title: Zero-Knowledge and the race for transparent proof systems
  (Based on joint work with Scott Ames, Carmit Hazay and Yuval Ishai)
  
  
  Abstract: Succinct non-interactive ZK argument of knowledge or zk-SNARKs, a variant of ZK proof systems, have recently gained a lot of attention as a tool that enables anonymity and integrity in blockchain technologies and forms the backbone of the Zcash cryptocurrency. However, the current (efficient) solutions either rely on trusted setup (i.e. not transparent) or make heavy use of public-key primitives and/or complex combinatorial objects (eg, probabilistically checkable proofs). I will survey recent results and describe some recent work on highly efficient transparent zk-SNARKs that avoid heavy public-key machinery and trusted setup. I will describe several applications for blockchain technologies and general secure computation where our zero-knowledge argument will improve the state-of-the-art and present some on-going work.
  
  Bio: Muthu Venkitasubramaniam is an Associate Professor at the University of Rochester. He received his BTech degree in computer science from the Indian Institute of Technology, Madras in 2004. He attended Cornell University, where he worked with Rafael Pass receiving his Ph.D. in computer science in 2011. Before arriving at the University of Rochester, he spent a year at the Courant Institute of Mathematical Sciences (NYU) as a postdoctoral researcher supported by the Computing Innovation Fellowship. Muthu's interests are in the theory and practice of Cryptography and Network Security. He is a recipient of the Google Faculty Research award and his work on "L-Diversity: Privacy beyond K-Anonymity" received the ICDE 2017 Influential Paper Award.



Time	Speaker	Title
9:30 - 11:00	Muthuramakrishnan Venkitasubramaniam	Blockchains and its promises for the future
11:30 - 12:30	Muthuramakrishnan Venkitasubramaniam	Zero-Knowledge and the race for transparent proof systems
14:00 - 15:30	Mike Rosulek	Garbled circuits for secure computation- Part I
16:00 - 17:00	Mike Rosulek	Garbled circuits for secure computation- Part II


Pre-Conference Events

Time	Event
16:45 - 18:00	Registration and TCS Souvenir Distribution.
18:00 - 18:30	Tea followed by discussions with Digital security Association of India, hosted by Dr. Muthukumaran on Securing e-Communication. V.Rajendran on Data Loss and Cyber Laws.