22:10

Leftover Hash Lemma, Revisited (Crypto 2011)

IACR

15:12

Random Oracle Reducibility (Crypto 2011)

IACR

19:52

Time-Lock Puzzles in the Random Oracle Model

IACR

18:22

Physically Uncloneable Functions in the Universal Composition Framework

IACR

23:42

Computer-Aided Security Proofs for the Working Cryptographer (Crypto 2011)

IACR

56:57

Illegitimi Non Carborundum (IACR Distinguished Lecture by Ron Rivest)

IACR

20:37

Optimal Verification of Operations on Dynamic Sets (Crypto 2011)

IACR

20:55

Verifiable Delegation of Computation over Large Datasets (Crypto 2011)

IACR

21:17

Secure Computation on the Web: Computing without Simultaneous Interaction (Crypto 2011)

IACR

19:51

Memory Delegation (Crypto 2011)

IACR

19:17

Automatic Search of Attacks on Round-Reduced AES and Applications (Crypto 2011)

IACR

17:39

Cryptanalysis of PrintCIPHER

IACR

17:52

The PHOTON Family of Lightweight Hash Functions (Crypto 2011)

IACR

19:45

Perfectly-Secure Multiplication for any t < n/3 (Crypto 2011)

IACR

21:07

The IPS Compiler: Optimizations, Variants and Concrete Efficiency (Crypto 2011)

IACR

16:56

1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds (Crypto 2011)

IACR

19:29

Leakage-Resilient Zero Knowledge (Crypto 2011)

IACR

17:37

A Comprehensive Evaluation of Mutual Information Analysis Using a Fair Evaluation Framework

IACR

18:48

Generic Side-Channel Distinguishers: Improvements and Limitations (Crypto 2011)

IACR

20:36

Cryptography with Tamperable and Leaky Memory (Crypto 2011)

IACR

18:37

Merkle Puzzles in a Quantum World

IACR

19:25

Classical Cryptographic Protocols in a Quantum World

IACR

23:51

Position-Based Quantum Cryptography: Impossibility and Constructions

IACR

18:51

Analyzing Blockwise Lattice Algorithms using Dynamical Systems

IACR

38:00

Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions

IACR

1:08:25

Tor and Circumvention: Lessons Learned, by Roger Dingledine

IACR

19:52

Fully Homomorphic Encryption over the Integers with Shorter Public Keys

IACR

22:42

Bi-Deniable Public-Key Encryption

IACR

20:24

The Collision Security of Tandem-DM in the Ideal Cipher Model

IACR

20:26

Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions

IACR

41:48

A New Variant of PMAC: Beyond the Birthday Bound

IACR

18:27

Authenticated and Misuse-Resistant Encryption of Key-Dependent Data

IACR

20:09

Round Optimal Blind Signatures in the Standard Model

IACR

21:04

Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups

IACR

20:19

Constant-Rate Oblivious Transfer from Noisy Channels

IACR

20:05

The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing

IACR

19:12

Public-Key Identification Schemes Based on Multivariate Quadratic Polynomials

IACR

22:02

Inverting HFE Systems is Quasi-Polynomial for All Fields

IACR

20:53

Smaller Decoding Exponents: Ball-Collision Decoding

IACR

16:23

McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks

IACR