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.

3877 videos

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

28:05

Trick or Tweak On the Insecurity of OTR’s Tweaks

24:15

Universal Forgery and Key Recovery Attacks on ELmD Authenticated Encryption Algorithm

24:56

Statistical Fault Attacks on Nonce Based Authenticated Encryption Schemes

25:00

Authenticated Encryption with Variable Stretch

55:53

Asiacrypt Invited Lecture II Hoeteck Wee, Advances in Functional Encryption

29:59

Nonlinear Invariant Attack –Practical Attack on Full SCREAM, iSCREAM,and Midori64

22:22

Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions

27:32

Towards Tightly Secure Lattice Short Signature and Id Based Encryption

28:49

From Identification to Signatures, Tightly A Framework and Generic Transforms

21:32

How to Obtain Fully Structure Preserving Automorphic Signatures from Structure Preserving ones

54:24

Asiacrypt 2016 Rump Session

38:48

General IACR Business Meeting

24:17

Verifiable Functional Encryption

26:40

Partitioning via Non Linear Polynomial Functions More Compact IBEs from Ideal Lattices and

20:35

NIZKs with an Untrusted CRS Security in the Face of Parameter Subversion

25:46

Multi Key Homomorphic Authenticators

25:51

Multi Input Functional Encryption with Unbounded Message Security

25:19

Iterated Random Oracle A Universal Approach for Finding Loss in Security Reduction

1:07:07

Neal Koblitz, Cryptography in Vietnam in the French and American Wars

24:16

Reverse Cycle Walking and Its Applications

18:12

Applying MILP Method to Searching Integral Distinguishers Based on Division Property for ...

29:06

A New Algorithm for the Unbalanced Meet in the Middle Problem

20:10

Unknown-Input Attacks in the Parallel Setting: Improving the Security of the ...

23:51

Taylor Expansion of Maximum Likelihood Attacks for Masked and Shuffled Implementations

23:34

Characterisation and Estimation of the Key Rank Distribution in the context of side channel ...

46:52

Side Channel Analysis Protection and Low Latency in Action - Case Study of PRINCE and Midori

25:07

Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions

26:55

Efficient Public-Key Cryptography with Bounded Leakage and Tamper Resilience

31:25

Cryptographic Reverse Firewall via Malleable Smooth Projective Hash Functions

28:22

A Tale of Two Shares Why Two Share Threshold Implementation Seems Worthwhile - and Why It Is Not

22:50

A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors

27:10

Cryptographic applications of capacity theory On the optimality of Coppersmith's Method for ...

29:54

The Kernel Matrix Diffie Hellman Assumption

33:03

Optimization of LPN Solving Algorithms

27:50

A Shuffle Argument Secure in the Generic Model

27:07

Constant Round Asynchronous Multi Party Computation Based on One Way Functions

23:58

Efficient Public Key Distance Bounding Protocol

22:51

How to Circumvent the Two Ciphertext Lower Bound for Linear Garbling Schemes

27:27

Indistinguishable Proofs of Work or Knowledge

21:06

Reactive Garbling Foundation, Instantiation, Application

28:14

Size-Hiding Computation for Multiple Parties

22:16

Universal Composition with Responsive Environments

21:07

Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security

25:54

Key Wrapping for Cryptographic APIs

21:33

Indifferentiability of 8 Round Feistel Networks

20:06

Lattice Based Fully Dynamic Multi Key FHE with Short Ciphertexts

19:17

Lightweight Multiplication in GF2n with Applications to MDS Matrices

23:48

Memory Efficient Algorithms for Finding Needles in Haystacks

21:23

Message Transmission with Reverse Firewalls – Secure Communication on Corrupted Machines

19:28

New Insights on AES Like SPN Ciphers

19:14

Optimal Security Proofs for Signatures from Identification Schemes

19:03

ParTI Towards Combined Hardware Countermeasures against Side Channel and Fault Injection Attacks

47:37

Crypto 2016 Rump Session Part 1

51:53

Crypto 2016 Rump session part 2.

55:42

Crypto 2016 Rump session part 3.

21:23

The Magic of ELFs

24:44

The Multi User Security of Authenticated Encryption AES GCM in TLS 1 3

22:10

The SKINNY Family of Lightweight Tweakable Block Ciphers

17:42

Towards Sound Fresh Re Keying with Hard Physical Learning Problems

22:39

XPX Generalized Tweakable Even Mansour with Improved Security Guarantees

18:11

On Statistically Secure Obfuscation with Approximate Correctness

21:55

On the Communication required for Unconditionally Secure Multiplication

23:03

On the Power of Secure Two Party Computation

21:58

On the Relationship between Statistical Zero Knowledge and Statistical Randomized Encodings

25:25

Probabilistic Termination and Composability of Cryptographic Protocols

25:03

Programmable Hash Functions from Lattices

21:02

Quantum Homomorphic Encryption for Polynomial sized Circuits

22:33

Rate 1, Linear Time and Additively Homomorphic UC Commitments

24:58

Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium

16:58

Secure Protocol Transformations

24:22

Semantic Security and Indistinguishability in the Quantum World

20:46

Separate Separations of CPA and Circular Security for Any Cycle Length

22:51

Two Message Oblivious Evaluation of Cryptographic Functionalities

24:46

TWORAM Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption

23:13

UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens

24:37

Universal Obfuscation and Witness Encryption Boosting Correctness and Combining Security

20:46

Obfuscation Combiners

18:29

Network Hiding Communication and Applications to Multi Party Protocols

21:23

Network Oblivious Transfer

22:27

Linicrypt A Model for Practical Cryptography

22:31

How to Prove Knowledge of Small Secrets

20:51

Fine grained Cryptography

15:29

FHE Circuit Privacy Almost For Free

23:38

Extended Tower Number Field Sieve A New Complexity for the Medium Prime Case

23:02

EWCDM An Efficient, Beyond Birthday Secure, Nonce Misuse Resistant MAC

23:12

Encryption Switching Protocols

24:28

Efficiently Computing Data Independent Memory Hard Functions

18:03

Efficient Zero Knowledge Proof of Algebraic and Non Algebraic Statements with Applications to Privac

29:06

Efficient Algorithms for Supersingular Isogeny Diffie Hellman

22:37

Design in Type I, Run in Type III Fast and Scalable Bilinear Type Conversion using Integer Programm

19:41

Cryptography with Auxiliary Input and Trapdoor from Constant Noise LPN

17:14

Cryptanalysis of the FLIP Family of Stream Ciphers

25:16

Cryptanalysis of GGH15 Multilinear Maps

19:03

Cryptanalysis of a Theorem Decomposing the Only Known Solution to the Big APN Problem

22:56

Counter in Tweak Authenticated Encryption Modes for Tweakable Block Ciphers

16:55

Concurrent Non Malleable Commitments and More in 3 Rounds

26:32

Breaking the Circuit Size Barrier for Secure Computation Under DDH

21:08

Breaking Symmetric Cryptosystems using Quantum Period Finding

21:39

Bounded Indistinguishability and the Complexity of Recovering Secrets

23:15

Big Key Symmetric Encryption Resisting Key Exfiltration