18:04

Homomorphic Evaluation of the AES Circuit

17:28

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

22:47

Fully Homomorphic Encryption without Modulus Switching f ...

5:11

Welcome to Crypto 2012

3:49

The end of crypto

52:38

Another Look at Provable Security.

24:18

Malleable Proof Systems and Applications.

21:39

Unconditionally-Secure Robust Secret Sharing with Compac ...

26:32

Property Preserving Symmetric Encryption.

26:33

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller.

24:29

Efficient and Optimally Secure Key-Length Extension for ...

1:00:54

A Tutorial on High Performance Computing Applied to Cryp ...

20:23

Optimal Security Proofs for Full Domain Hash, Revisited.

22:26

Adaptively Attribute-Hiding (Hierarchical) Inner Product ...

24:21

Tightly-Secure Signatures from Lossy Identification Schemes.

22:35

Fully Homomorphic Encryption with Polylog Overhead.

24:32

Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 ...

22:08

Narrow-Bicliques: Cryptanalysis of Full IDEA.

21:43

Fair Computation with Rational Players.

21:23

Key-Alternating Ciphers in a Provable Setting: Encryptio ...

21:50

Detecting Dangerous Queries: A New Approach for Chosen C ...

24:52

Multiparty Computation with Low Communication, Computati ...

22:38

Cryptanalyses on a Merkle-Damgård Based MAC - Almo ...

24:08

Incremental Deterministic Public-Key Encryption.

26:28

On the Exact Security of Schnorr-Type Signatures in the ...

28:32

Public Key Compression and Modulus Switching for Fully H ...

23:04

Lattice Signatures without Trapdoors.

22:41

Statistical Tools Flavor Side-Channel Collision Attacks.

25:16

Faster Algorithms for Approximate Common Divisors: Break ...

20:30

Efficient Zero-Knowledge Argument for Correctness of a S ...

16:35

Pseudorandom Functions and Lattices.

21:37

Standard Security Does Not Imply Security against Select ...

21:24

Quantum Proofs of Knowledge.

20:20

Concurrently Secure Computation in Constant Rounds.

20:58

Identity-Based Encryption Resilient to Continual Auxilia ...

21:10

Message Authentication, Revisited.

22:34

All-But-Many Lossy Trapdoor Functions.

23:58

Identity-Based (Lossy) Trapdoor Functions and Applications.

17:35

Security of Symmetric Encryption in the Presence of Ciph ...

19:06

Robust Coin Flipping.

32:46

Cover and Decomposition Index Calculus on Elliptic Curve ...

57:55

Tutorial on Homomorphic Encryption (part 2)

42:38

Tutorial on Homomorphic Encryption (part 1)

19:41

Efficient Arithmetic on Hessian Curves.

26:48

Functional Encryption for Inner Product: Achieving Const ...

20:45

Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model.

19:16

More Constructions of Lossy and Correlation-Secure Trapdoor Functions.

22:31

On the Feasibility of Consistent Computations.

22:16

Efficient Set Operations in the Presence of Malicious Adversaries.

21:05

Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval.

29:58

Secure Network Coding over the Integers.

21:54

Security of Encryption Schemes in Weakened Random Oracle Models.

23:35

Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions.

23:43

Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes.

21:30

Algebraic Cryptanalysis of the PKC'2009 Algebraic Surface Cryptosystem.

17:29

CCA Proxy Re-Encryption without Bilinear Maps in the Standard Model.

19:32

Constant Size Ciphertexts in Threshold Attribute-Based Encryption.

26:05

Faster Pairing Computations on Curves with High-Degree Twists.

15:50

Confidential Signatures and Deterministic Signcryption.

25:49

Preventing Pollution Attacks in Multi-source Network Coding.

22:44

Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA.

21:45

Text Search Protocols with Simulation Based Security.

24:26

Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions.

20:19

Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments.

1:02:45

Duality in Lattice Based Cryptography

18:10

Solving a 676-Bit Discrete Logarithm Problem in GF(3^6n).

26:19

Identity-Based Aggregate and Multi-Signature Schemes Based on RSA.

18:27

Authenticated and Misuse-Resistant Encryption of Key-Dependent Data

23:51

Position-Based Quantum Cryptography: Impossibility and Constructions

18:51

Analyzing Blockwise Lattice Algorithms using Dynamical Systems

18:37

Merkle Puzzles in a Quantum World

19:25

Classical Cryptographic Protocols in a Quantum World

20:19

Constant-Rate Oblivious Transfer from Noisy Channels

41:48

A New Variant of PMAC: Beyond the Birthday Bound

20:26

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

20:24

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

19:12

Public-Key Identification Schemes Based on Multivariate Quadratic Polynomials

22:42

Bi-Deniable Public-Key Encryption

19:52

Fully Homomorphic Encryption over the Integers with Shorter Public Keys

16:23

McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks

22:02

Inverting HFE Systems is Quasi-Polynomial for All Fields

20:53

Smaller Decoding Exponents: Ball-Collision Decoding

20:05

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

38:00

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

20:09

Round Optimal Blind Signatures in the Standard Model

21:04

Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups

5:17

Consensus in the Asynchronous Hybrid Byzantine Model with Optimal Resilience

4:17

Secure Computation with Sublinear Amortized Work

5:47

Computer-Aided Search Heuristic for Blind Revocable Identity Based Encryption Schemes

4:42

HB^N: An HB-like protocol secure against Man-in-the-Middle attacks

4:49

The Garden-Hose Model

4:31

NIST Announcements

3:43

Non-Malleable Codes in the Split-State Model

4:52

Extreme Threshold Cryptosystems

4:39

(More) Efficient Secure Computation from Garbled Circuits

4:18

Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption

3:55

Blinding ballot copying in Helios: from Condorcet to IACR

4:33

The Hunting of the SNARK

11:47

The 2011 IACR Fellowship Induction Ceremony

4:00

A brief chat about approximate GCDs