The two volume-set, LNCS 8616 and LNCS 8617, constitutes the refereed proceedings of the 34th Annual International Cryptology Conference, CRYPTO 2014, held in Santa Barbara, CA, USA, in August 2014.
The 60 revised full papers presented in LNCS 8616 and LNCS 8617 were carefully reviewed and selected from 227 submissions. The papers are organized in topical sections on symmetric encryption and PRFs; formal methods; hash functions; groups and maps; lattices; asymmetric encryption and signatures; side channels and leakage resilience; obfuscation; FHE; quantum cryptography; foundations of hardness; number-theoretic hardness; information-theoretic security; key exchange and secure communication; zero knowledge; composable security; secure computation - foundations; secure computation - implementations.
Author(s): Juan A. Garay, Rosario Gennaro (eds.)
Series: Lecture Notes in Computer Science 8617 Security and Cryptology
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2014
Language: English
Pages: 532
Tags: Data Encryption; Systems and Data Security; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science
Front Matter....Pages -
Quantum Position Verification in the Random Oracle Model....Pages 1-18
Single-Shot Security for One-Time Memories in the Isolated Qubits Model....Pages 19-36
How to Eat Your Entropy and Have It Too – Optimal Recovery Strategies for Compromised RNGs....Pages 37-54
Cryptography with Streaming Algorithms....Pages 55-70
The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator....Pages 71-89
Self-bilinear Map on Unknown Order Groups from Indistinguishability Obfuscation and Its Applications....Pages 90-107
On Virtual Grey Box Obfuscation for General Circuits....Pages 108-125
Breaking ‘128-bit Secure’ Supersingular Binary Curves....Pages 126-145
Leakage-Tolerant Computation with Input-Independent Preprocessing....Pages 146-163
Interactive Proofs under Continual Memory Leakage....Pages 164-182
Amplifying Privacy in Privacy Amplification....Pages 183-198
On the Communication Complexity of Secure Computation....Pages 199-216
Optimal Non-perfect Uniform Secret Sharing Schemes....Pages 217-234
Proving the TLS Handshake Secure (As It Is)....Pages 235-255
Memento: How to Reconstruct Your Secrets from a Single Password in a Hostile Environment....Pages 256-275
Scalable Zero Knowledge via Cycles of Elliptic Curves....Pages 276-294
Switching Lemma for Bilinear Tests and Constant-Size NIZK Proofs for Linear Subspaces....Pages 295-312
Physical Zero-Knowledge Proofs of Physical Properties....Pages 313-336
Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity....Pages 337-350
Round-Efficient Black-Box Construction of Composable Multi-Party Computation....Pages 351-368
Secure Multi-Party Computation with Identifiable Abort....Pages 369-386
Non-Interactive Secure Multiparty Computation....Pages 387-404
Feasibility and Infeasibility of Secure Computation with Malicious PUFs....Pages 405-420
How to Use Bitcoin to Design Fair Protocols....Pages 421-439
FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR....Pages 440-457
Amortizing Garbled Circuits....Pages 458-475
Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings....Pages 476-494
Dishonest Majority Multi-Party Computation for Binary Circuits....Pages 495-512
Efficient Three-Party Computation from Cut-and-Choose....Pages 513-530
Back Matter....Pages -
