Cryptography

Bibliographic References tagged with Cryptography

Not finding what you're looking for? Try using Advanced Search.
Not finding what you're looking for? Try using Advanced Search.
Haitner, Iftach, Thomas Holenstein, Omer Reingold, Salil Vadhan, and Hoeteck Wee. “Inaccessible Entropy II: IE Functions and Universal One-Way Hashing”. Theory of Computing 16, no. 8 (2020): 1-55.
Haitner, Iftach, Thomas Holenstein, Omer Reingold, Salil Vadhan, and Hoeteck Wee. “Inaccessible Entropy II: IE Functions and Universal One-Way Hashing”. Theory of Computing 16, no. 8 (2020): 1-55.
Haitner, Iftach, Omer Reingold, and Salil Vadhan. “Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions”. SIAM Journal on Computing 42, no. 3 (2013): 1405-30.
Haitner, Iftach, Omer Reingold, and Salil Vadhan. “Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions”. SIAM Journal on Computing 42, no. 3 (2013): 1405-30.
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.
Mahmoody, Mohammad, Tal Moran, and Salil Vadhan. “Time-Lock Puzzles in the Random Oracle Model”. In P. Rogaway, Editor, Advances in Cryptology—CRYPTO ‘11, Lecture Notes in Computer Science, 6841:39-50. Springer-Verlag, 2011.
Mahmoody, Mohammad, Tal Moran, and Salil Vadhan. “Time-Lock Puzzles in the Random Oracle Model”. In P. Rogaway, Editor, Advances in Cryptology—CRYPTO ‘11, Lecture Notes in Computer Science, 6841:39-50. Springer-Verlag, 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.
Vadhan, Salil, and Colin Jia Zheng. “Characterizing Pseudoentropy and Simplifying Pseudorandom Generator Constructions”. In Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC ‘12), 817-36. ACM, 2012.
Vadhan, Salil, and Colin Jia Zheng. “Characterizing Pseudoentropy and Simplifying Pseudorandom Generator Constructions”. In Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC ‘12), 817-36. ACM, 2012.
Raghunathan, Ananth, Gil Segev, and Salil P. Vadhan. “Deterministic Public-Key Encryption for Adaptively-Chosen Plaintext Distributions”. Journal of Cryptology 31, no. 4 (2018): 1012-63.
Raghunathan, Ananth, Gil Segev, and Salil P. Vadhan. “Deterministic Public-Key Encryption for Adaptively-Chosen Plaintext Distributions”. Journal of Cryptology 31, no. 4 (2018): 1012-63.
Vadhan, Salil, and Colin Jia Zheng. “A Uniform Min-Max Theorem With Applications in Cryptography”. In Ran Canetti and Juan Garay, Editors, Advances in Cryptology—CRYPTO ‘13, Lecture Notes on Computer Science, 8042:93-110. Springer Verlag, Lecture Notes in Computer Science, 2013.
Vadhan, Salil, and Colin Jia Zheng. “A Uniform Min-Max Theorem With Applications in Cryptography”. In Ran Canetti and Juan Garay, Editors, Advances in Cryptology—CRYPTO ‘13, Lecture Notes on Computer Science, 8042:93-110. Springer Verlag, Lecture Notes in Computer Science, 2013.
Bun, Mark, Jonathan Ullman, and Salil Vadhan. “Fingerprinting Codes and the Price of Approximate Differential Privacy”. SIAM Journal on Computing, Special Issue on STOC ’14 47, no. 5 (2018): 1888-1938.
Bun, Mark, Jonathan Ullman, and Salil Vadhan. “Fingerprinting Codes and the Price of Approximate Differential Privacy”. SIAM Journal on Computing, Special Issue on STOC ’14 47, no. 5 (2018): 1888-1938.