The two-volume set LNCS 9014 and LNCS 9015 constitutes the refereed proceedings of the 12th International Conference on Theory of Cryptography, TCC 2015, held in Warsaw, Poland in March 2015.
The 52 revised full papers presented were carefully reviewed and
selected from 137 submissions. The papers are organized in topical
sections on foundations, symmetric key, multiparty computation,
concurrent and resettable security, non-malleable codes and tampering, privacy amplification, encryption an key exchange, pseudorandom functions and applications, proofs and verifiable computation, differential privacy, functional encryption, obfuscation.
Author(s): Yevgeniy Dodis, Jesper Buus Nielsen (eds.)
Series: Lecture Notes in Computer Science 9014
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2015
Language: English
Pages: 660
Tags: Data Encryption; Systems and Data Security; Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science
Front Matter....Pages -
On Basing Size-Verifiable One-Way Functions on NP-Hardness....Pages 1-6
The Randomized Iterate, Revisited - Almost Linear Seed Length PRGs from a Broader Class of One-Way Functions....Pages 7-35
The Power of Negations in Cryptography....Pages 36-65
From Weak to Strong Zero-Knowledge and Applications....Pages 66-92
An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle....Pages 93-109
On the Indifferentiability of Key-Alternating Feistel Ciphers with No Key Derivation....Pages 110-133
A Little Honesty Goes a Long Way....Pages 134-158
Topology-Hiding Computation....Pages 159-181
Secure Physical Computation Using Disposable Circuits....Pages 182-198
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions....Pages 199-228
Richer Efficiency/Security Trade-offs in 2PC....Pages 229-259
Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma....Pages 260-289
An Alternative Approach to Non-black-box Simulation in Fully Concurrent Setting....Pages 290-318
General Statistically Secure Computation with Bounded-Resettable Hardware Tokens....Pages 319-344
Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way....Pages 345-374
A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations....Pages 375-397
Leakage-Resilient Non-malleable Codes....Pages 398-426
Locally Decodable and Updatable Non-malleable Codes and Their Applications....Pages 427-450
Tamper Detection and Continuous Non-malleable Codes....Pages 451-480
Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model....Pages 481-501
Non-malleable Condensers for Arbitrary Min-entropy, and Almost Optimal Protocols for Privacy Amplification....Pages 502-531
From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes....Pages 532-560
Constructing and Understanding Chosen Ciphertext Security via Puncturable Key Encapsulation Mechanisms....Pages 561-590
Non-committing Encryption from Φ-hiding....Pages 591-608
On the Regularity of Lossy RSA....Pages 609-628
Tightly-Secure Authenticated Key Exchange....Pages 629-658
Back Matter....Pages -
