55:57

Obvious in Hindsight From Side Channel Attacks to the Security Challenges Ahead

IACR

45:47

Akamai Faster Forward Crypto at Scale

IACR

16:41

A 2^70 Attack on the Full MISTY1

IACR

22:41

A Practical Cryptanalysis of the Algebraic Eraser

IACR

22:36

Adaptive Versus Non Adaptive Strategies in the Quantum Setting with Applications

IACR

23:44

A subfield lattice attack on overstretched NTRU assumptions Cryptanalysis of some FHE and Graded En

IACR

23:13

Adaptively Secure Garbled Circuits from One Way Functions

IACR

22:01

Adversary dependent Lossy Trapdoor Function from Hardness of Factoring Semi smooth RSA Subgroup Modu

IACR

22:19

Annihilation Attacks for Multilinear Maps Cryptanalysis of Indistinguishability Obfuscation over GG

IACR

25:04

Another View of the Division Property

IACR

24:38

Automatic Search of Meet in the Middle and Impossible Differential Attacks

IACR

20:35

Backdoors in Pseudorandom Number Generators Possibility and Impossibility Results

IACR

23:15

Big Key Symmetric Encryption Resisting Key Exfiltration

IACR

21:39

Bounded Indistinguishability and the Complexity of Recovering Secrets

IACR

21:08

Breaking Symmetric Cryptosystems using Quantum Period Finding

IACR

26:32

Breaking the Circuit Size Barrier for Secure Computation Under DDH

IACR

16:55

Concurrent Non Malleable Commitments and More in 3 Rounds

IACR

22:56

Counter in Tweak Authenticated Encryption Modes for Tweakable Block Ciphers

IACR

19:03

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

IACR

25:16

Cryptanalysis of GGH15 Multilinear Maps

IACR

17:14

Cryptanalysis of the FLIP Family of Stream Ciphers

IACR

19:41

Cryptography with Auxiliary Input and Trapdoor from Constant Noise LPN

IACR

22:37

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

IACR

29:06

Efficient Algorithms for Supersingular Isogeny Diffie Hellman

IACR

18:03

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

IACR

24:28

Efficiently Computing Data Independent Memory Hard Functions

IACR

23:12

Encryption Switching Protocols

IACR

23:02

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

IACR

23:38

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

IACR

15:29

FHE Circuit Privacy Almost For Free

IACR

20:51

Fine grained Cryptography

IACR

22:31

How to Prove Knowledge of Small Secrets

IACR

22:27

Linicrypt A Model for Practical Cryptography

IACR

21:23

Network Oblivious Transfer

IACR

18:29

Network Hiding Communication and Applications to Multi Party Protocols

IACR

20:46

Obfuscation Combiners

IACR

24:37

Universal Obfuscation and Witness Encryption Boosting Correctness and Combining Security

IACR

23:13

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

IACR

24:46

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

IACR

22:51

Two Message Oblivious Evaluation of Cryptographic Functionalities

IACR

20:46

Separate Separations of CPA and Circular Security for Any Cycle Length

IACR

24:22

Semantic Security and Indistinguishability in the Quantum World

IACR

16:58

Secure Protocol Transformations

IACR

24:58

Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium

IACR

22:33

Rate 1, Linear Time and Additively Homomorphic UC Commitments

IACR

21:02

Quantum Homomorphic Encryption for Polynomial sized Circuits

IACR

25:03

Programmable Hash Functions from Lattices

IACR

25:25

Probabilistic Termination and Composability of Cryptographic Protocols

IACR

21:58

On the Relationship between Statistical Zero Knowledge and Statistical Randomized Encodings

IACR

23:03

On the Power of Secure Two Party Computation

IACR

21:55

On the Communication required for Unconditionally Secure Multiplication

IACR

18:11

On Statistically Secure Obfuscation with Approximate Correctness

IACR

22:39

XPX Generalized Tweakable Even Mansour with Improved Security Guarantees

IACR

17:42

Towards Sound Fresh Re Keying with Hard Physical Learning Problems

IACR

22:10

The SKINNY Family of Lightweight Tweakable Block Ciphers

IACR

24:44

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

IACR

21:23

The Magic of ELFs

IACR

55:42

Crypto 2016 Rump session part 3.

IACR

51:53

Crypto 2016 Rump session part 2.

IACR

47:37

Crypto 2016 Rump Session Part 1

IACR

19:03

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

IACR

19:14

Optimal Security Proofs for Signatures from Identification Schemes

IACR

19:28

New Insights on AES Like SPN Ciphers

IACR

21:23

Message Transmission with Reverse Firewalls – Secure Communication on Corrupted Machines

IACR

23:48

Memory Efficient Algorithms for Finding Needles in Haystacks

IACR

19:17

Lightweight Multiplication in GF2n with Applications to MDS Matrices

IACR

20:06

Lattice Based Fully Dynamic Multi Key FHE with Short Ciphertexts

IACR

21:07

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

IACR

25:54

Key Wrapping for Cryptographic APIs

IACR

21:33

Indifferentiability of 8 Round Feistel Networks

IACR