Search
International Association for Cryptologic Research
What's new
Archive
Best Papers
Videos
Authors
Coauthors
By year
By conference
All Committees
Most Committees
Report errors
Maps
About
Publications of crypto 2014
Page
Title
Caught in Between Theory and Practice
How to delegate computations: the power of no-signaling proofs
1-19
Security of Symmetric Encryption against Mass Surveillance
1-18
Quantum Position Verification in the Random Oracle Model
19-36
Single-Shot Security for One-Time Memories in the Isolated Qubits Model
20-38
The Security of Multiple Encryption in the Ideal Cipher Model
37-54
How to Eat Your Entropy and Have It Too - Optimal Recovery Strategies for Compromised RNGs
39-56
Minimizing the Two-Round Even-Mansour Cipher
55-70
Cryptography with Streaming Algorithms
57-76
Block Ciphers - Focus on the Linear Layer (feat. PRIDE)
71-89
The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator
77-94
Related-Key Security for Pseudorandom Functions Beyond the Linear Barrier
90-107
Self-bilinear Map on Unknown Order Groups from Indistinguishability Obfuscation and Its Applications
95-112
Automated Analysis of Cryptographic Assumptions in Generic Group Models
108-125
On Virtual Grey Box Obfuscation for General Circuits
113-130
The Exact PRF-Security of NMAC and HMAC
126-145
Breaking '128-bit Secure' Supersingular Binary Curves - (Or How to Solve Discrete Logarithms in F
2
4 1223
and F
2
12 367
)
131-148
Updates on Generic Attacks against HMAC and NMAC
146-163
Leakage-Tolerant Computation with Input-Independent Preprocessing
149-168
Improved Generic Attacks against Hash-Based MACs and HAIFA
164-182
Interactive Proofs under Continual Memory Leakage
169-187
Cryptography from Compression Functions: The UCE Bridge to the ROM
183-198
Amplifying Privacy in Privacy Amplification
188-205
Indistinguishability Obfuscation and UCEs: The Case of Computationally Unpredictable Sources
199-216
On the Communication Complexity of Secure Computation
206-223
Low Overhead Broadcast Encryption from Multilinear Maps
217-234
Optimal Non-perfect Uniform Secret Sharing Schemes
224-240
Security Analysis of Multilinear Maps over the Integers
235-255
Proving the TLS Handshake Secure (As It Is)
241-260
Converting Cryptographic Schemes from Symmetric to Asymmetric Bilinear Groups
256-275
Memento: How to Reconstruct Your Secrets from a Single Password in a Hostile Environment
261-279
Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations
276-294
Scalable Zero Knowledge via Cycles of Elliptic Curves
280-296
Revisiting the Gentry-Szydlo Algorithm
295-312
Switching Lemma for Bilinear Tests and Constant-Size NIZK Proofs for Linear Subspaces
297-314
Faster Bootstrapping with Polynomial Error
313-336
Physical Zero-Knowledge Proofs of Physical Properties
315-334
Hardness of k-LWE and Applications in Traitor Tracing
335-352
Improved Short Lattice Signatures in the Standard Model
337-350
Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity
351-368
Round-Efficient Black-Box Construction of Composable Multi-Party Computation
353-370
New and Improved Key-Homomorphic Pseudorandom Functions
369-386
Secure Multi-Party Computation with Identifiable Abort
371-389
Homomorphic Signatures with Efficient Verification for Polynomial Functions
387-404
Non-Interactive Secure Multiparty Computation
390-407
Structure-Preserving Signatures from Type II Pairings
405-420
Feasibility and Infeasibility of Secure Computation with Malicious PUFs
408-425
(Hierarchical) Identity-Based Encryption from Affine Message Authentication
421-439
How to Use Bitcoin to Design Fair Protocols
426-443
Witness Encryption from Instance Independent Assumptions
440-457
FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR
444-461
RSA Key Extraction via Low-Bandwidth Acoustic Cryptanalysis
458-475
Amortizing Garbled Circuits
462-479
On the Impossibility of Cryptography with Tamperable Randomness
476-494
Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
480-499
Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
495-512
Dishonest Majority Multi-Party Computation for Binary Circuits
500-517
Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
513-530
Efficient Three-Party Computation from Cut-and-Choose
518-535
On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input
536-553
Maliciously Circuit-Private FHE
554-571
Algorithms in HElib