11:47

The 2011 IACR Fellowship Induction Ceremony

IACR

4:41

An historical call for papers ...

IACR

3:45

Rethinking IDEA

IACR

6:22

Biclique cryptanalysis of the full AES

IACR

3:30

Observations on H-PRESENT-128

IACR

1:34

An Application Of Frequency Shift Keying To Communication Resynchronisation

IACR

2:17

Practical demonstration of Bananb Target Collisions for Skein with NIST KAT files

IACR

4:35

Improving the Indifferentiability Security Bounds for the Fast Wide-pipe and the JH Modes

IACR

3:03

Variants of Sponge-like Construction

IACR

3:06

A silent competition for ultra-fast public key cryptography

IACR

2:51

Secure Verification of Delegated Presentation Delivery

IACR

5:22

Robust Coin Flipping

IACR

3:25

FlipIt and the Cramér-Rao bound

IACR

5:19

Illegitimi Non Irritatum (aut Lorem Ipsum Deserti Omnium)

IACR

4:02

An update about HiDalgo:

IACR

2:03

Panel discussion on leakage

IACR

4:26

Pseudorandom Functions and Lattices

IACR

3:05

Predicate Encryption for Inner Products from LWE

IACR

4:00

A brief chat about approximate GCDs

IACR

4:18

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

IACR

3:32

Bounds on Cloud File Retrievability

IACR

3:55

Blinding ballot copying in Helios: from Condorcet to IACR

IACR

4:42

Remotegrity

IACR

4:33

The Hunting of the SNARK

IACR

4:18

Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption

IACR

3:43

Non-Malleable Codes in the Split-State Model

IACR

4:31

NIST Announcements

IACR

4:39

(More) Efficient Secure Computation from Garbled Circuits

IACR

4:49

The Garden-Hose Model

IACR

4:52

Extreme Threshold Cryptosystems

IACR

5:17

Consensus in the Asynchronous Hybrid Byzantine Model with Optimal Resilience

IACR

4:42

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

IACR

4:17

Secure Computation with Sublinear Amortized Work

IACR

5:47

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

IACR