IACR - Channel

IACR

IACR

The IACR is the International Association for Cryptologic Research, online at http://www.iacr.org/ This channel is maintained by Kevin McCurley and Kay McKelly.

3843 videos

Sort by views Sort by oldest Sorted by newest Sort by newest - no shorts

4:42

Remotegrity

4:26

Pseudorandom Functions and Lattices

3:32

Bounds on Cloud File Retrievability

4:18

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

4:02

An update about HiDalgo:

3:05

Predicate Encryption for Inner Products from LWE

5:19

Illegitimi Non Irritatum (aut Lorem Ipsum Deserti Omnium)

5:22

Robust Coin Flipping

2:03

Panel discussion on leakage

2:51

Secure Verification of Delegated Presentation Delivery

3:25

FlipIt and the Cramér-Rao bound

3:03

Variants of Sponge-like Construction

4:35

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

3:06

A silent competition for ultra-fast public key cryptography

2:17

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

6:22

Biclique cryptanalysis of the full AES

3:30

Observations on H-PRESENT-128

1:34

An Application Of Frequency Shift Keying To Communication Resynchronisation

3:45

Rethinking IDEA

4:41

An historical call for papers ...

1:08:25

Tor and Circumvention: Lessons Learned, by Roger Dingledine

5:36

Crypto 2011 introductory remarks

2:00

Panel Discussion on Leakage

20:36

Cryptography with Tamperable and Leaky Memory (Crypto 2011)

18:48

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

17:37

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

19:29

Leakage-Resilient Zero Knowledge (Crypto 2011)

16:56

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

21:07

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

19:45

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

17:52

The PHOTON Family of Lightweight Hash Functions (Crypto 2011)

17:39

Cryptanalysis of PrintCIPHER

19:17

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

19:51

Memory Delegation (Crypto 2011)

21:17

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

20:55

Verifiable Delegation of Computation over Large Datasets (Crypto 2011)

20:37

Optimal Verification of Operations on Dynamic Sets (Crypto 2011)

56:57

Illegitimi Non Carborundum (IACR Distinguished Lecture by Ron Rivest)

23:42

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

18:22

Physically Uncloneable Functions in the Universal Composition Framework

19:52

Time-Lock Puzzles in the Random Oracle Model

15:12

Random Oracle Reducibility (Crypto 2011)

22:10

Leftover Hash Lemma, Revisited (Crypto 2011)