Proof Systems

Bibliographic References tagged with Proof Systems

Not finding what you're looking for? Try using Advanced Search.
Not finding what you're looking for? Try using Advanced Search.
Chung, Kai-Min, Yael Kalai, and Salil Vadhan. “Improved Delegation of Computation Using Fully Homomorphic Encryption”. In T. Rabin, Editor, Advances in Cryptology—CRYPTO ‘10, Lecture Notes in Computer Science, 6223:483-501. Springer-Verlag, 2010.
Chung, Kai-Min, Yael Kalai, and Salil Vadhan. “Improved Delegation of Computation Using Fully Homomorphic Encryption”. In T. Rabin, Editor, Advances in Cryptology—CRYPTO ‘10, Lecture Notes in Computer Science, 6223:483-501. Springer-Verlag, 2010.
Dvir, Zeev, Dan Gutfreund, Guy Rothblum, and Salil Vadhan. “On Approximating the Entropy of Polynomial Mappings”. In Proceedings of the Second Symposium on Innovations in Computer Science (ICS 2011), 460-75. Tsinghua University Press, 2011.
Dvir, Zeev, Dan Gutfreund, Guy Rothblum, and Salil Vadhan. “On Approximating the Entropy of Polynomial Mappings”. In Proceedings of the Second Symposium on Innovations in Computer Science (ICS 2011), 460-75. Tsinghua University Press, 2011.
Dodis, Yevgeniy, Thomas Ristenpart, and Salil Vadhan. “Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources”. In Ronald Cramer, Editor, Proceedings of the 9th IACR Theory of Cryptography Conference (TCC ‘12), Lecture Notes on Computer Science, 7194:618-35. Springer-Verlag, 2012.
Dodis, Yevgeniy, Thomas Ristenpart, and Salil Vadhan. “Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources”. In Ronald Cramer, Editor, Proceedings of the 9th IACR Theory of Cryptography Conference (TCC ‘12), Lecture Notes on Computer Science, 7194:618-35. Springer-Verlag, 2012.
Mahmoody, Mohammad, Tal Moran, and Salil Vadhan. “Publicly Verifiable Proofs of Sequential Work”. In Innovations in Theoretical Computer Science (ITCS ‘13), 373-88. ACM, 2013.
Mahmoody, Mohammad, Tal Moran, and Salil Vadhan. “Publicly Verifiable Proofs of Sequential Work”. In Innovations in Theoretical Computer Science (ITCS ‘13), 373-88. ACM, 2013.
Rothblum, Guy N., Salil Vadhan, and Avi Wigderson. “Interactive Proofs of Proximity: Delegating Computation in Sublinear Time”. In Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC ‘13), 793-802. New York, NY: ACM, 2013.
Rothblum, Guy N., Salil Vadhan, and Avi Wigderson. “Interactive Proofs of Proximity: Delegating Computation in Sublinear Time”. In Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC ‘13), 793-802. New York, NY: ACM, 2013.
Chen, Yi-Hsiu, Mika Goos, Salil P. Vadhan, and Jiapeng Zhang. “A Tight Lower Bound for Entropy Flattening”. In 33rd Computational Complexity Conference (CCC 2018), 102:23:21-23:28. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik: Leibniz International Proceedings in Informatics (LIPIcs), 2018.
Chen, Yi-Hsiu, Mika Goos, Salil P. Vadhan, and Jiapeng Zhang. “A Tight Lower Bound for Entropy Flattening”. In 33rd Computational Complexity Conference (CCC 2018), 102:23:21-23:28. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik: Leibniz International Proceedings in Informatics (LIPIcs), 2018.
Goldreich, Oded, Amit Sahai, and Salil Vadhan. “Honest-Verifier Statistical Zero-Knowledge Equals General Statistical Zero-Knowledge.”. Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC ‘98), 1998, 399-408.
Goldreich, Oded, Amit Sahai, and Salil Vadhan. “Honest-Verifier Statistical Zero-Knowledge Equals General Statistical Zero-Knowledge.”. Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC ‘98), 1998, 399-408.
Bender, Michael A., Antonio Fernández, Dana Ron, Amit Sahai, and Salil Vadhan. “The Power of a Pebble: Exploring and Mapping Directed Graphs.”. Information and Computation 176, no. 1 (2002): 1-21.
Bender, Michael A., Antonio Fernández, Dana Ron, Amit Sahai, and Salil Vadhan. “The Power of a Pebble: Exploring and Mapping Directed Graphs.”. Information and Computation 176, no. 1 (2002): 1-21.
Sahai, Amit, and Salil Vadhan. “ Manipulating Statistical Difference.”. Randomization Methods in Algorithm Design (DIMACS Workshop, December 1997), Volume 43 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science 43 (1999): 251-70.
Sahai, Amit, and Salil Vadhan. “ Manipulating Statistical Difference.”. Randomization Methods in Algorithm Design (DIMACS Workshop, December 1997), Volume 43 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science 43 (1999): 251-70.
Sahai, Amit, and Salil Vadhan. “A Complete Problem for Statistical Zero Knowledge.”. Journal of the ACM 50, no. 2 (2003): 196-249.
Sahai, Amit, and Salil Vadhan. “A Complete Problem for Statistical Zero Knowledge.”. Journal of the ACM 50, no. 2 (2003): 196-249.