From Statistical Zero Knowledge to Secret Sharing Vinod Vaikuntanathan∗ MIT CSAIL Prashant Nalini Vasudevan†

First Page		Document Content
Date: 2015-03-24 23:55:10 Complexity classes Cryptographic protocols Probabilistic complexity theory Zero-knowledge proof Interactive proof system IP NP Secret sharing Randomized algorithm Theoretical computer science Computational complexity theory Applied mathematics		From Statistical Zero Knowledge to Secret Sharing Vinod Vaikuntanathan∗ MIT CSAIL Prashant Nalini Vasudevan† Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 443,33 KB Share Document on Facebook

	Probabilistic Modeling and Model Checking Erika Ábrahám RWTH Aachen University, Germany SFM’14 Tutorial June 17, 2014 DocID: 1rrqu - View Document
	Spheres of Influence for More Effective Viral Marketing Yasir Mehmood Francesco Bonchi David García-Soriano DocID: 1riqm - View Document
	Competitive Online Algorithms Susanne Albers Overview arrive one by one and must be scheduled immediately DocID: 1ri9G - View Document
	Computing the Width of a Point Set in 3-Spa e Thomas Herrmann Institute for Theoreti al Computer S ien e Institute for Operations Resear h DocID: 1rhdY - View Document
	Master thesis ANALYSIS OF A SIMPLE METHOD TO APPROXIMATE THE EXPECTED STATE OF A MARKOV CHAIN By DocID: 1rdMz - View Document