Theory of Cryptography - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

25

(FIVE YEARS 0)

H-INDEX

8

(FIVE YEARS 0)

Published By Springer International Publishing

9783319705026, 9783319705033

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On Iterative Collision Search for LPN and Subset Sum

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-319-70503-3_24 ◽

2017 ◽

pp. 729-746 ◽

Author(s):

Srinivas Devadas ◽

Ling Ren ◽

Hanshen Xiao

Keyword(s):

Download Full-text

Strengthening the Security of Encrypted Databases: Non-transitive JOINs

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-319-70503-3_21 ◽

2017 ◽

pp. 631-661 ◽

Author(s):

Ilya Mironov ◽

Gil Segev ◽

Ido Shahaf

Download Full-text

On the One-Per-Message Unforgeability of (EC)DSA and Its Variants

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-319-70503-3_17 ◽

2017 ◽

pp. 519-534 ◽

Author(s):

Manuel Fersch ◽

Eike Kiltz ◽

Bertram Poettering

Keyword(s):

Download Full-text

Circuit OPRAM: Unifying Statistically and Computationally Secure ORAMs and OPRAMs

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-319-70503-3_3 ◽

2017 ◽

pp. 72-107 ◽

Author(s):

T.-H. Hubert Chan ◽

Elaine Shi

Download Full-text

Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-319-70503-3_19 ◽

2017 ◽

pp. 567-594 ◽

Author(s):

Nir Bitansky

Keyword(s):

Random Functions ◽

Verifiable Random Functions

Download Full-text

Round Optimal Concurrent Non-malleability from Polynomial Hardness

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-319-70503-3_5 ◽

2017 ◽

pp. 139-171 ◽

Author(s):

Dakshita Khurana

Download Full-text

Can PPAD Hardness be Based on Standard Cryptographic Assumptions?

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-319-70503-3_25 ◽

2017 ◽

pp. 747-776 ◽

Author(s):

Alon Rosen ◽

Gil Segev ◽

Ido Shahaf

Keyword(s):

Cryptographic Assumptions

Download Full-text

Batched Multi-hop Multi-key FHE from Ring-LWE with Compact Ciphertext Extension

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-319-70503-3_20 ◽

2017 ◽

pp. 597-627 ◽

Author(s):

Long Chen ◽

Zhenfeng Zhang ◽

Xueqing Wang

Download Full-text

Four-State Non-malleable Codes with Explicit Constant Rate

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-319-70503-3_11 ◽

2017 ◽

pp. 344-375 ◽

Author(s):

Bhavana Kanukurthi ◽

Sai Lakshmi Bhavana Obbattu ◽

Sruthi Sekar

Keyword(s):

Constant Rate ◽

Explicit Constant

Download Full-text

Adaptively Indistinguishable Garbled Circuits

Theory of Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-319-70503-3_2 ◽

2017 ◽

pp. 40-71 ◽

Author(s):

Zahra Jafargholi ◽

Alessandra Scafuro ◽

Daniel Wichs

Keyword(s):

Garbled Circuits

Download Full-text