Theory of Cryptography - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783662536407, 9783662536414

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Strong Hardness of Privacy from Weak Traitor Tracing

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-662-53641-4_25 ◽

2016 ◽

pp. 659-689 ◽

Cited By ~ 4

Author(s):

Lucas Kowalczyk ◽

Tal Malkin ◽

Jonathan Ullman ◽

Mark Zhandry

Keyword(s):

Traitor Tracing

Download Full-text

Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-662-53641-4_9 ◽

2016 ◽

pp. 204-234 ◽

Cited By ~ 1

Author(s):

Ignacio Cascudo ◽

Ivan Damgård ◽

Felipe Lacerda ◽

Samuel Ranellucci

Keyword(s):

Key Agreement ◽

Oblivious Transfer ◽

Noisy Channel ◽

Secret Key ◽

Secret Key Agreement

Download Full-text

Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-662-53641-4_15 ◽

2016 ◽

pp. 367-399 ◽

Cited By ~ 14

Author(s):

Carmit Hazay ◽

Antigoni Polychroniadou ◽

Muthuramakrishnan Venkitasubramaniam

Download Full-text

Secure Multiparty RAM Computation in Constant Rounds

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-662-53641-4_19 ◽

2016 ◽

pp. 491-520 ◽

Cited By ~ 13

Author(s):

Sanjam Garg ◽

Divya Gupta ◽

Peihan Miao ◽

Omkant Pandey

Download Full-text

3-Message Zero Knowledge Against Human Ignorance

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-662-53641-4_3 ◽

2016 ◽

pp. 57-83 ◽

Cited By ~ 9

Author(s):

Nir Bitansky ◽

Zvika Brakerski ◽

Yael Kalai ◽

Omer Paneth ◽

Vinod Vaikuntanathan

Keyword(s):

Zero Knowledge

Download Full-text

From Indifferentiability to Constructive Cryptography (and Back)

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-662-53641-4_1 ◽

2016 ◽

pp. 3-24 ◽

Cited By ~ 8

Author(s):

Ueli Maurer ◽

Renato Renner

Download Full-text

Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-662-53641-4_24 ◽

2016 ◽

pp. 635-658 ◽

Cited By ~ 52

Author(s):

Mark Bun ◽

Thomas Steinke

Keyword(s):

Lower Bounds ◽

Differential Privacy

Download Full-text

Cross and Clean: Amortized Garbled Circuits with Constant Overhead

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-662-53641-4_22 ◽

2016 ◽

pp. 582-603 ◽

Cited By ~ 3

Author(s):

Jesper Buus Nielsen ◽

Claudio Orlandi

Keyword(s):

Garbled Circuits

Download Full-text

Fast Pseudorandom Functions Based on Expander Graphs

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-662-53641-4_2 ◽

2016 ◽

pp. 27-56 ◽

Cited By ~ 5

Author(s):

Benny Applebaum ◽

Pavel Raykov

Keyword(s):

Expander Graphs ◽

Pseudorandom Functions

Download Full-text

Binary AMD Circuits from Secure Multiparty Computation

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-662-53641-4_14 ◽

2016 ◽

pp. 336-366 ◽

Cited By ~ 7

Author(s):

Daniel Genkin ◽

Yuval Ishai ◽

Mor Weiss

Keyword(s):

Secure Multiparty Computation ◽

Multiparty Computation

Download Full-text

Theory of Cryptography - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Strong Hardness of Privacy from Weak Traitor Tracing

Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement

Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity

Secure Multiparty RAM Computation in Constant Rounds

3-Message Zero Knowledge Against Human Ignorance

From Indifferentiability to Constructive Cryptography (and Back)

Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds

Cross and Clean: Amortized Garbled Circuits with Constant Overhead

Fast Pseudorandom Functions Based on Expander Graphs

Binary AMD Circuits from Secure Multiparty Computation

Theory of Cryptography - Lecture Notes in Computer Science
Latest Publications