Lecture Notes in Computer Science - Advances in Cryptology – CRYPTO 2012
Latest Publications

TOTAL DOCUMENTS

50

(FIVE YEARS 0)

H-INDEX

23

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642320088, 9783642320095

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Quantum to Classical Randomness Extractors

Lecture Notes in Computer Science - Advances in Cryptology – CRYPTO 2012 ◽

10.1007/978-3-642-32009-5_45 ◽

2012 ◽

pp. 776-793 ◽

Author(s):

Mario Berta ◽

Omar Fawzi ◽

Stephanie Wehner

Keyword(s):

Randomness Extractors

Download Full-text

The End of Crypto

Lecture Notes in Computer Science - Advances in Cryptology – CRYPTO 2012 ◽

10.1007/978-3-642-32009-5_6 ◽

2012 ◽

pp. 86-86 ◽

Author(s):

Jonathan Zittrain

Download Full-text

An Enciphering Scheme Based on a Card Shuffle

Lecture Notes in Computer Science - Advances in Cryptology – CRYPTO 2012 ◽

10.1007/978-3-642-32009-5_1 ◽

2012 ◽

pp. 1-13 ◽

Author(s):

Viet Tung Hoang ◽

Ben Morris ◽

Phillip Rogaway

Download Full-text

Multiparty Computation from Somewhat Homomorphic Encryption

Lecture Notes in Computer Science - Advances in Cryptology – CRYPTO 2012 ◽

10.1007/978-3-642-32009-5_38 ◽

2012 ◽

pp. 643-662 ◽

Author(s):

Ivan Damgård ◽

Valerio Pastro ◽

Nigel Smart ◽

Sarah Zakarias

Keyword(s):

Homomorphic Encryption ◽

Multiparty Computation ◽

Somewhat Homomorphic Encryption

Download Full-text

Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority

Lecture Notes in Computer Science - Advances in Cryptology – CRYPTO 2012 ◽

10.1007/978-3-642-32009-5_39 ◽

2012 ◽

pp. 663-680 ◽

Author(s):

Eli Ben-Sasson ◽

Serge Fehr ◽

Rafail Ostrovsky

Keyword(s):

Secure Multiparty Computation ◽

Multiparty Computation

Download Full-text

Must You Know the Code of f to Securely Compute f?

Lecture Notes in Computer Science - Advances in Cryptology – CRYPTO 2012 ◽

10.1007/978-3-642-32009-5_7 ◽

2012 ◽

pp. 87-104 ◽

Author(s):

Mike Rosulek

Download Full-text

Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits

Lecture Notes in Computer Science - Advances in Cryptology – CRYPTO 2012 ◽

10.1007/978-3-642-32009-5_16 ◽

2012 ◽

pp. 255-272 ◽

Author(s):

Nir Bitansky ◽

Alessandro Chiesa

Keyword(s):

Interactive Proofs

Download Full-text

Securing Circuits against Constant-Rate Tampering

Lecture Notes in Computer Science - Advances in Cryptology – CRYPTO 2012 ◽

10.1007/978-3-642-32009-5_31 ◽

2012 ◽

pp. 533-551 ◽

Author(s):

Dana Dachman-Soled ◽

Yael Tauman Kalai

Keyword(s):

Download Full-text

Semantic Security for the Wiretap Channel

Lecture Notes in Computer Science - Advances in Cryptology – CRYPTO 2012 ◽

10.1007/978-3-642-32009-5_18 ◽

2012 ◽

pp. 294-311 ◽

Author(s):

Mihir Bellare ◽

Stefano Tessaro ◽

Alexander Vardy

Keyword(s):

Wiretap Channel ◽

Semantic Security

Download Full-text

On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups

Lecture Notes in Computer Science - Advances in Cryptology – CRYPTO 2012 ◽

10.1007/978-3-642-32009-5_47 ◽

2012 ◽

pp. 812-831 ◽

Author(s):

Goichiro Hanaoka ◽

Takahiro Matsuda ◽

Jacob C. N. Schuldt

Keyword(s):

Prime Order ◽

Download Full-text