21:53

Efficient Constant Round Multi Party Computation Combining BMR and SPDZ

19:57

Efficient Pseudorandom Functions via On the Fly Adaptation

18:16

An Algebraic Framework for Pseudorandom Functions and Applications to Related Key Security

48:51

The State of Cryptographic Multilinear Maps

20:46

Cryptography with One Way Communication

19:32

Efficient Zero Knowledge Proofs of Non Algebraic Statements with Sublinear Amortized Cost

17:15

Observations on the SIMON Block Cipher Family

23:57

A Simpler Variant of Universally Composable Security for Standard Multiparty Computation

17:41

An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices

27:19

Concurrent Secure Computation with Optimal Query Complexity

26:08

Almost Optimal Constructions of UOWHFs from 1 to 1, Regular One way Functions and Beyond

21:33

Multi Key Security The Even Mansour Construction Revisted

16:23

Capacity and Data Complexity in Multidimensional Linear Attack

20:01

Parallel Hashing via List Recoverability

23:21

Statistical Concurrent Non malleable Zero knowledfe from One way Functions

19:49

Concurrent Secure Computation via Non Black Box Simulation

20:58

Tweaking Even Mansour Ciphers

18:58

Implicit Zero Knowledge Arguments and Applications to the Malicious Setting

20:23

Links Among Impossible Differential, Integral and Zero Correlation Linear Cryptanalysis

20:30

Constant Round MPC with Fairness and Guarantee of Output Delivery

1:13:39

Phil Rogaway - IACR Distinguished Lecture 2015

2:49

500 Bits - Implementor's Lament

6:10

IO Obfuscation

57:32

FSE 2013 Rump Session

1:00:57

Invited Talk: Failures of secret key cryptography

26:38

Impossible plaintext cryptanalysis and probable plaintext collision attacks of 64 bit block ci

1:42

Program Chair' Opening Remarks

23:35

A Low Data Complexity Attack on the GMR-2 Cipher Used in the Satellite Phones

20:44

On Symmetric Encryption with Distinguishable Decryption Failures

22:42

Reflection Cryptanalysis of PRINCE-Like Ciphers

21:07

Security Analysis of PRINCE

22:50

Higher-Order Side Channel Security and Mask Refreshing

19:52

Cryptanalysis of WIDEA

23:22

Attacks and Security Proofs of EAX-Prime

22:41

Full Plaintext Recovery Attack on Broadcast RC4

58:30

Towards Secure Distance Bounding

20:42

A New Criterion for Avoiding the Propagation of Linear Relations Through an Sbox

22:30

Near Collision Attack on the Grain v1 Stream Cipher

23:14

Smashing WEP in a Passive Attack

23:41

Improving Key Recovery to 784 and 799 Rounds of Trivium Using Optimized Cube Attacks

27:03

Collision Attacks on Up to 5 Rounds of SHA-3 Using Generalized Internal Differentials

20:27

ALE: AES-Based Lightweight Authenticated Encryption

23:18

Exhausting Demirci-Selçuk Meet-in-the-Middle Attacks Against Reduced-Round AES

24:07

Tweakable Blockciphers with Asymptotically Optimal Security

24:41

Partial-Collision Attack on the Round-Reduced Compression Function of Skein-256

24:16

Time-Memory Trade-Offs for Near-Collisions

25:30

Towards Understanding the Known-Key Security of Block Ciphers

24:06

Cryptanalysis of Round-Reduced LED

24:21

Secure Message Authentication Against Related-Key Attack

24:02

Complementing Feistel Ciphers

22:53

A Framework for Automated Independent-Biclique Cryptanalysis

25:53

Rotational Cryptanalysis of Round-Reduced Keccak

20:14

Masking Tables - An Underestimated Security Risk

24:09

Related-Key Attacks Against Full Hummingbird-2

19:01

On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes

20:08

On the Wrong Key Randomisation and Key Equivalence Hypotheses in Matsui's Algorithm 2

18:04

Hierarchical Identity Based Encryption from Affine Messafe Authentication

17:10

FleXOR: Flexible garbling for XOR gates that beats free-XOR

18:28

Memento: How to Reconstruct Your Secrets from a Single Password in a Hostile Environment

18:50

Breaking '128-bit Secure' Supersingular Binary Curves

20:28

Leakage-Tolerant Computation with Input-Independent Preprocessing

21:38

On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with ...

18:22

On Virtual Grey Box Obfuscation for General Circuits

20:55

How to Use Bitcoin to Design Fair Protocols

19:43

Scalable Zero Knowledge via Cycles of Elliptic Curves

16:08

Block Ciphers - Focus on the Linear Layer (feat. PRIDE)

19:01

Physical Zero-Knowledge Proofs of Physical Properties

16:56

Cryptography with Streaming Algorithms

18:02

Dishonest Majority Multi-Party Computation for Binary Circuits

19:02

RSA Key Extraction via Low-Bandwidth Acoustic Cryptanalysis

17:06

Cryptography from Compression Functions: The UCE Bridge to the ROM

19:02

Improved Short Lattice Signatures in the Standard Model

19:01

How to Eat Your Entropy and Have It Too - Optimal Recovery Strategies for Compromised RNGs

19:02

The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator

18:56

Low Overhead Broadcast Encryption from Multilinear Maps

18:19

New and Improved Key-Homomorphic Pseudorandom Functions

15:32

Related-Key Security for Pseudorandom Functions Beyond the Linear Barrier

19:58

Homomorphic Signatures with Efficient Verification for Polynomial Functions

19:05

Structure-Preserving Signatures from Type II Pairings

17:21

Indistinguishability Obfuscation and UCEs: The Case of Computationally Unpredictable Sources

18:02

Optimal Non-perfect Uniform Secret Sharing Schemes

18:31

Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations

18:57

The Security of Multiple Encryption in the Ideal Cipher Model

16:41

Improved Generic Attacks against Hash-Based MACs and HAIFA

18:20

Maliciously Circuit-Private FHE

16:12

Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity

20:21

Non-Interactive Secure Multiparty Computation

15:06

Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation

20:49

Hardness of k-LWE and Applications in Traitor Tracing

17:51

Amplifying Privacy in Privacy Amplification

19:12

Single-Shot Security for One-Time Memories in the Isolated Qubits Model

16:03

Self-bilinear Map on Unknown Order Groups from Indistinguishability Obfuscation and Its Applications

17:51

Automated Analysis of Cryptographic Assumptions in Generic Group Models

18:44

Proving the TLS Handshake Secure (As It Is)

18:35

Faster Bootstrapping with Polynomial Error

18:16

Security Analysis of Multilinear Maps over the Integers

17:08

Updates on Generic Attacks against HMAC and NMAC

18:20

Quantum Position Verification in the Random Oracle Model

19:21

Interactive Proofs under Continual Memory Leakage

19:23

Algorithms in HElib