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

21:01

Efficient Fuzzy Extraction of PUF Induced Secrets Theory and Applications

21:01

Differential Computation Analysis Hiding your White Box Designs is Not Enough

22:05

Curious case of Rowhammer Flipping Secret Exponent Bits using Timing Analysis

23:02

Correlated Extra Reductions Defeat Blinded Regular Exponentiation

21:12

CacheBleed A Timing Attack on OpenSSL Constant Time RSA

18:52

Cache Attacks Enable Bulk Key Recovery on the Cloud

20:05

Antikernel A Decentralized Secure Hardware Software Operating System

20:25

A High Throughput Gate AES Hardware Architecture by Compressing Encryption and Decryption Datapaths

17:35

A Design Methodology for Stealthy Parametric Trojans and Its Application to Bug Attacks

22:42

Multi-input Functional Encryption in the Private-Key Setting: ...

16:51

New negative results on differing-inputs obfuscation

24:40

On the Impossibility of Tight Cryptographic Reductions

22:53

All Complete Functionalities are Reversible

24:16

Secure Computation from Elastic Noisy Channels

25:31

On the Power of Hierarchical Identity-Based Encryption

22:39

Online/Offline OR Composition of Sigma Protocols

25:25

Adaptively Secure Identity-Based Encryption from Lattices with ...

20:45

Zero-Knowledge Arguments for Lattice-Based Accumulators

25:41

From Improved Leakage Detection to the Detection of Points of Interests in Leakage Traces

24:36

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption

21:33

Sanitization of FHE Ciphertexts

28:07

Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts

24:37

Essentially Optimal Robust Secret Sharing with Maximal Corruptions

26:00

Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes

25:32

Tightly CCA-Secure Encryption Without Pairings

23:27

Provably Weak Instances of Ring-LWE Revisited

24:49

Faster Algorithms for Solving LPN

27:59

Provably Robust Sponge-Based PRNGs and KDFs

1:00:31

Protecting TLS from legacy crypto, Karthikeyan Bhargavan

25:15

Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN

27:59

On the Size of Pairing-Based Non-interactive Arguments

25:36

On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model

24:44

Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key

20:32

Unconditionally Secure Computation with Reduced Interaction

23:30

The Exact Round Complexity of Secure Computation

1:50:51

CFRG Meeting

22:48

Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance

24:04

Recovering Short Generators of Principal Ideals in Cyclotomic Rings, by oded regev

24:35

Circuit Compilers with O(1/\\log (n)) Leakage Rate

28:30

Computationally Binding Quantum Commitments

25:10

Two Round Multiparty Computation via Multi-key FHE

25:30

Indifferentiability of Confusion-Diffusion Networks

19:46

Randomness Complexity of Private Circuits for Multiplication

19:25

Structural Lattice Reduction: Generalized Worst-Case to Average-case Reductions and ...

24:55

Fair and Robust MPC using a Global Transaction Ledger

24:16

Improved Progressive BKZ Algorithms and their Precise Cost Estimation by Sharp Simulator

57:20

Securing Cryptography Implementations in Embedded Systems, part I

58:16

Engineering Code Obfuscation

1:04:44

2016 IACR Distinguished Lecture: The future of cryptography by Bart Preneel

41:11

3 1040 1130

22:29

Freestart Collision for Full SHA-1

1:00:01

Security Cryptography Implementations in Embedded Systems, Part 2.

22:49

Improved Differential-Linear Cryptanalysis of 7-round Chaskey with Partitioning

23:39

New Attacks on the Concatenation and XOR Hash Combiners

44:10

IACR Business meeting, Eurocrypt 2016

2:14:47

Eurocrypt 2016 Rump Session

23:33

Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group Model

42:27

3 1135 1225

18:46

Constrained Pseudorandom Functions for Unconstrained Inputs

28:17

Multi Identity and Multi Key Leveled FHE from Learning with Errors

21:36

Secure Computation from Leaky Correlated Randomness

24:10

Quantum Homomorphic Encryption for Circuits of Low T gate Complexity

23:28

Practical Free Start Collision Attacks on the 76 Step SHA 1

23:24

Malicious for free OT Extension The Pipe is the Limit

23:05

Incoercible Multi Party Computation and Universally Composable Receipt Free Voting

23:27

Large Scale Secure Computation Multi Party Computation for Parallel RAM Programs

20:20

Higher Order Differential Meet in the Middle Preimage Attacks on SHA 1 and BLAKE

23:13

From Selective to Adaptive Security in Functional Encryption

19:44

A Punctured Programming Approach to Adaptive Security in Functional Encryption

24:50

Fast Correlation Attacks over Extension Fields, Large unite Linear Approximation and Cryptoanalysis

23:45

Decaf Eliminating Cofactors Through Quotients and Isogenies

21:16

Efficient Multi Party Computation, From Passive to Active Security via Secure SIMD Circuits

27:12

Algebriac Decomposition for Probing Security

27:12

Online Authenticated Encryption and its Nonce Reuse Misuse Resistance

23:54

Proofs of Space

21:57

Arguments of Proximity

22:44

Cryptanalysis of the ASASA Cryptosystem with Expanding S boxes

24:12

New Attacks on Feistel Structures with Improved Memory Complexities

26:45

Distributions Attaining Secret Key at a Rate of the Conditional Mutual Information

18:22

Communication Complexity of Conditional Disclosure of Secrets and Attribute Based Encryption

18:21

Bit Commitment schemes with Non Signaling Adversaries

20:35

Cryptanalysis of the Co ACD Assumption

20:13

Explicit Non malleable Codes against Bit wise Tampering adn Permutations

17:38

Known key Distinguisher on Full PRESENT

16:35

Bilinear Entropy Expansion from the Decisional Linear Assumption

36:59

Cryptography, Security, and Public Safety A Policy Perspective

21:39

Data Is a Stream Security of Stream Based Channels

21:55

Predicate Encryption for Circuits from LWE

18:00

Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP

22:38

Integral Cryptanalysis on Full MISTY1

22:09

Bloom Filters in Adversarial Environments

23:45

Zeroizing Without Low level Zeroes New Attacks on Multilinear Maps and Thier Limitations

22:42

Secure Computation with Minimal Interaction, Revisited

24:56

The Exact PRF Security of Truncation Tight Bounds for Keyed Sponges and Truncated CBC

18:48

The Iterated Random Permutation Problem with Applications to Cascade Encryption

19:31

Programmable Hash Functions go Private Constructions and Applications to Homomorphic Signatures wit

19:49

Practical Round Optimal Blind Signatures in the Standard Model

22:15

Indistinguishability Obfuscation from Compact Functional Encryption

18:39

Constant Round Concurrent Zero knowledge from Indistinguishability Obfuscation

21:21

PoW Based Distributed Cryptography with no Trusted Setup