The two volume-set, LNCS 8042 and LNCS 8043, constitutes the refereed proceedings of the 33rd Annual International Cryptology Conference, CRYPTO 2013, held in Santa Barbara, CA, USA, in August 2013. The 61 revised full papers presented in LNCS 8042 and LNCS 8043 were carefully reviewed and selected from numerous submissions. Two abstracts of the invited talks are also included in the proceedings. The papers are organized in topical sections on lattices and FHE; foundations of hardness; cryptanalysis; MPC - new directions; leakage resilience; symmetric encryption and PRFs; key exchange; multi linear maps; ideal ciphers; implementation-oriented protocols; number-theoretic hardness; MPC - foundations; codes and secret sharing; signatures and authentication; quantum security; new primitives; and functional encryption.
Author(s): Yehuda Lindell (auth.), Ran Canetti, Juan A. Garay (eds.)
Series: Lecture Notes in Computer Science 8043
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2013
Language: English
Pages: 558
Tags: Data Encryption; Systems and Data Security; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Computer Science, general; Computer Science, general
Front Matter....Pages -
Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries....Pages 1-17
Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose....Pages 18-35
Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation....Pages 36-53
Improved OT Extension for Transferring Short Secrets....Pages 54-70
Time-Optimal Interactive Proofs for Circuit Evaluation....Pages 71-89
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge....Pages 90-108
Linearly Homomorphic Structure-Preserving Signatures and Their Applications....Pages 289-307
Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs....Pages 308-325
Achieving the Limits of the Noisy-Storage Model Using Entanglement Sampling....Pages 326-343
Quantum One-Time Programs....Pages 344-360
On the Function Field Sieve and the Impact of Higher Splitting Probabilities....Pages 109-128
An Algebraic Framework for Diffie-Hellman Assumptions....Pages 129-147
Hard-Core Predicates for a Diffie-Hellman Problem over Finite Fields....Pages 148-165
Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys....Pages 166-184
Efficient Multiparty Protocols via Log-Depth Threshold Formulae....Pages 185-202
A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation....Pages 203-219
What Information Is Leaked under Concurrent Composition?....Pages 220-238
Non-malleable Codes from Two-Source Extractors....Pages 239-257
Optimal Coding for Streaming Authentication and Interactive Communication....Pages 258-276
Secret Sharing, Rank Inequalities and Information Inequalities....Pages 277-288
Secure Signatures and Chosen Ciphertext Security in a Quantum Computing World....Pages 361-379
Everlasting Multi-party Computation....Pages 380-397
Instantiating Random Oracles via UCEs....Pages 398-415
Obfuscating Conjunctions....Pages 416-434
Fully, (Almost) Tightly Secure IBE and Dual System Groups....Pages 435-460
Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption....Pages 461-478
Attribute-Based Encryption for Circuits from Multilinear Maps....Pages 479-499
Functional Encryption: New Perspectives and Lower Bounds....Pages 500-518
On the Achievability of Simulation-Based Security for Functional Encryption....Pages 519-535
How to Run Turing Machines on Encrypted Data....Pages 536-553
Erratum: A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation....Pages E1-E1
Back Matter....Pages -
