5:11

Welcome to Crypto 2012

IACR

20:11

An Enciphering Scheme Based on a Card Shuffle

IACR

16:38

Tweakable Blockciphers with Beyond Birthday-Bound Security

IACR

18:44

Breaking and Repairing GCM Security Proofs

IACR

18:35

On the Distribution of Linear Biases: Three Instructive ...

IACR

20:39

Substitution-Permutation Networks, Pseudorandom Function ...

IACR

1:05:37

The End of Crypto

IACR

19:13

Must You Know the Code of f to Securely Compute f?

IACR

15:48

Adaptively Secure Multi-Party Computation with Dishonest ...

IACR

21:27

Collusion-Preserving Computation

IACR

19:14

Secret Sharing Schemes for Very Dense Graphs

IACR

15:10

Functional Encryption with Bounded Collusions via Multi- ...

IACR

18:13

Dynamic Credentials and Ciphertext Delegation for Attrib ...

IACR

16:05

Functional Encryption for Regular Languages

IACR

19:57

Succinct Arguments from Multi-prover Interactive Proofs ...

IACR

19:03

On the Security of TLS-DHE in the Standard Model

IACR

18:14

Semantic Security for the Wiretap Channel

IACR

18:54

Multi-instance Security and Its Application to Password- ...

IACR

16:55

Hash Functions Based on Three Permutations: A Generic Se ...

IACR

19:40

To Hash or Not to Hash Again? (In)Differentiability Resu ...

IACR

11:25

New Preimage Attacks against Reduced SHA-1

IACR

19:06

Stam's Conjecture and Threshold Phenomena in Collision R ...

IACR

18:36

Universal Composability from Essentially Any Trusted Setup

IACR

13:46

New Impossibility Results for Concurrent Composition and ...

IACR

19:06

Black-Box Constructions of Composable Protocols without ...

IACR

1:26:15

Pinning Down "Privacy" in Statistical Databases

IACR

18:02

Crowd-Blending Privacy

IACR

20:31

Differential Privacy with Imperfect Randomness

IACR

19:28

Tamper and Leakage Resilience in the Split-State Model

IACR

18:20

Securing Circuits against Constant-Rate Tampering

IACR

14:58

Tightly Secure Signatures and Public-Key Encryption

IACR

19:19

Efficient Padding Oracle Attacks on Cryptographic Hardware

IACR

17:27

Public Keys

IACR

13:47

Multiparty Computation from Somewhat Homomorphic Encryption

IACR

18:58

Near-Linear Unconditionally-Secure Multiparty Computatio ...

IACR

15:50

A New Approach to Practical Active-Secure Two-Party Comp ...

IACR

22:00

The Curious Case of Non-Interactive Commitments - On the ...

IACR

23:27

Efficient Dissection of Composite Problems, with Applica ...

IACR

18:40

Resistance against Iterated Attacks by Decorrelation Rev ...

IACR

16:55

Secure Identity-Based Encryption in the Quantum Random O ...

IACR

20:15

Quantum to Classical Randomness Extractors

IACR

19:17

Actively Secure Two-Party Evaluation of Any Quantum Oper ...

IACR

18:16

On the Impossibility of Constructing Efficient Key Encap ...

IACR

18:04

Homomorphic Evaluation of the AES Circuit

IACR

17:28

Hardness of Computing Individual Bits for One-Way Functi ...

IACR

22:47

Fully Homomorphic Encryption without Modulus Switching f ...

IACR