Theory of Cryptography - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

36

(FIVE YEARS 0)

H-INDEX

17

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642289132, 9783642289149

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Hardness Preserving Constructions of Pseudorandom Functions

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-642-28914-9_21 ◽

2012 ◽

pp. 369-382 ◽

Author(s):

Abhishek Jain ◽

Krzysztof Pietrzak ◽

Aris Tentes

Keyword(s):

Pseudorandom Functions

Download Full-text

Lossy Functions Do Not Amplify Well

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-642-28914-9_26 ◽

2012 ◽

pp. 458-475 ◽

Author(s):

Krzysztof Pietrzak ◽

Alon Rosen ◽

Gil Segev

Download Full-text

Leakage-Resilient Circuits without Computational Assumptions

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-642-28914-9_13 ◽

2012 ◽

pp. 230-247 ◽

Author(s):

Stefan Dziembowski ◽

Sebastian Faust

Keyword(s):

Leakage Resilient

Download Full-text

Subspace LWE

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-642-28914-9_31 ◽

2012 ◽

pp. 548-563 ◽

Author(s):

Krzysztof Pietrzak

Download Full-text

Beyond the Limitation of Prime-Order Bilinear Groups, and Round Optimal Blind Signatures

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-642-28914-9_8 ◽

2012 ◽

pp. 133-150 ◽

Author(s):

Jae Hong Seo ◽

Jung Hee Cheon

Keyword(s):

Prime Order ◽

Blind Signatures ◽

Bilinear Groups

Download Full-text

Point Obfuscation and 3-Round Zero-Knowledge

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-642-28914-9_11 ◽

2012 ◽

pp. 190-208 ◽

Author(s):

Nir Bitansky ◽

Omer Paneth

Keyword(s):

Download Full-text

Uniqueness Is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-642-28914-9_36 ◽

2012 ◽

pp. 636-653 ◽

Author(s):

Dario Fiore ◽

Dominique Schröder

Keyword(s):

Random Functions ◽

Verifiable Random Functions ◽

Trapdoor Permutations

Download Full-text

The Knowledge Tightness of Parallel Zero-Knowledge

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-642-28914-9_29 ◽

2012 ◽

pp. 512-529 ◽

Author(s):

Kai-Min Chung ◽

Rafael Pass ◽

Wei-Lung Dustin Tseng

Keyword(s):

Download Full-text

Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-642-28914-9_35 ◽

2012 ◽

pp. 618-635 ◽

Author(s):

Yevgeniy Dodis ◽

Thomas Ristenpart ◽

Salil Vadhan

Keyword(s):

Dependent Sources

Download Full-text

Iterative Constructions and Private Data Release

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-642-28914-9_19 ◽

2012 ◽

pp. 339-356 ◽

Author(s):

Anupam Gupta ◽

Aaron Roth ◽

Jonathan Ullman

Keyword(s):

Private Data ◽

Download Full-text