|
|
|
MPC vs. SFE: Unconditional and Computational Security |
|
|
1 | (18) |
|
|
|
|
Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes |
|
|
19 | (18) |
|
|
|
|
|
|
Graph Design for Secure Multiparty Computation over Non-Abelian Groups |
|
|
37 | (17) |
|
|
|
|
|
|
Some Perspectives on Complexity-Based Cryptography |
|
|
54 | (1) |
|
|
Cryptographic Protocols I |
|
|
|
A Modular Security Analysis of the TLS Handshake Protocol |
|
|
55 | (19) |
|
|
|
|
Ambiguous Optimistic Fair Exchange |
|
|
74 | (16) |
|
|
|
|
|
Compact Proofs of Retrievability |
|
|
90 | (18) |
|
|
|
On the Security of HB# against a Man-in-the-Middle Attack |
|
|
108 | (17) |
|
|
|
|
Cryptographic Hash Functions I |
|
|
|
Hash Functions from Sigma Protocols and Improvements to VSH |
|
|
125 | (18) |
|
|
|
Slide Attacks on a Class of Hash Functions |
|
|
143 | (18) |
|
|
|
|
Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography |
|
|
161 | (18) |
|
|
|
Cryptographic Protocols II |
|
|
|
Universally Composable Adaptive Oblivious Transfer |
|
|
179 | (19) |
|
|
|
A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting |
|
|
198 | (18) |
|
|
|
Towards Robust Computation on Encrypted Data |
|
|
216 | (18) |
|
|
|
Efficient Protocols for Set Membership and Range Proofs |
|
|
234 | (19) |
|
|
|
|
Cryptographic Hash Functions II |
|
|
|
Preimage Attacks on 3, 4 and 5-Pass HAVAL |
|
|
253 | (19) |
|
|
|
How to Fill Up Merkle-Damgard Hash Functions |
|
|
272 | (18) |
|
|
Limits of Constructive Security Proofs |
|
|
290 | (18) |
|
|
|
Public-Key Cryptography I |
|
|
|
Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption |
|
|
308 | (18) |
|
|
|
Twisted Edwards Curves Revisited |
|
|
326 | (18) |
|
|
|
|
|
On the Validity of the &phis;-Hiding Assumption in Cryptographic Protocols |
|
|
344 | (11) |
|
|
|
Chosen Ciphertext Security with Optimal Ciphertext Overhead |
|
|
355 | (17) |
|
|
|
|
Lattice-Based Cryptography |
|
|
|
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems |
|
|
372 | (18) |
|
|
|
|
Rigorous and Efficient Short Lattice Vectors Enumeration |
|
|
390 | (16) |
|
|
|
Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits |
|
|
406 | (19) |
|
|
|
|
|
An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity |
|
|
425 | (16) |
|
|
|
An Improved Impossible Differential Attack on MISTY1 |
|
|
441 | (14) |
|
|
|
Public-Key Cryptography II |
|
|
|
Generalized Identity Based and Broadcast Encryption Schemes |
|
|
455 | (16) |
|
|
|
Speeding Up the Pollard Rho Method on Prime Fields |
|
|
471 | (18) |
|
|
|
|
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems |
|
|
489 | (17) |
|
|
|
|
|
|
OAEP Is Secure under Key-Dependent Messages |
|
|
506 | (18) |
|
|
|
|
Analysis of Stream Ciphers |
|
|
|
Cryptanalysis of Sosemanuk and SNOW 2.0 Using Linear Masks |
|
|
524 | (15) |
|
|
|
|
A New Attack on the LEX Stream Cipher |
|
|
539 | (18) |
|
|
|
Breaking the F-FCSR-H Stream Cipher in Real Time |
|
|
557 | (14) |
|
|
Author Index |
|
571 | |