26:36

Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation)

20:40

On the Existence of Three Round Zero-Knowledge Proofs

24:24

Statistical Witness Indistinguishability (and more) in Two Messages

24:06

An Efficiency-Preserving Transformation from ...

56:58

Thirty Years of Digital Currency: From Digicash to the Blockchain

24:02

Efficient Designated-Verifier Non-interactive Zero-Knowledge Proofs of Knowledge

25:22

Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs

26:34

Supersingular Isogeny Graphs and Endomorphism Rings: Reductions and Solutions

24:04

Fuzzy Password-Authenticated Key Exchange

25:31

Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange

22:29

OPAQUE: An Asymmetric PAKE Protocol Secure Against Pre-computation Attacks

25:04

Non-malleable Randomness Encoders and Their Applications

21:56

Non-malleable Codes from Average-Case Hardness: ...

26:38

Formal Verification of Masked Hardware Implementations in the Presence of Glitches

22:13

Masking the GLP Lattice-Based Signature Scheme at Any Order

29:05

Masking Proofs Are Tight and How to Exploit it in Security Evaluations

24:55

The Discrete-Logarithm Problem with Preprocessing

26:27

Simple Proofs of Sequential Work

24:51

Two-Round Multiparty Secure Computation from Minimal Assumptions

25:13

k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits

26:07

Cycle slicer An algorithm for building permutations on special domains

22:01

Tightly secure signatures from five move identification protocols

24:34

Blockcipher based MACs Beyond the Birthday Bound without Message Length

22:37

Two Round PAKE from Approximate SPH and Instantiations from Lattices

20:33

Succinct Spooky Free Compilers Are Not Black Box Sound

21:45

The Minimum Number of Cards in Practical Card based Protocols

23:05

Non interactive multiparty computation without correlated randomness

18:10

Preventing CLT Attacks on Obfuscation with Linear Overhead

22:48

Optimal rate non committing encryption

22:19

On the Untapped Potential of Encoding Predicates by Arithmetic Circuits and Their Applications

22:59

qDSA Small and Secure Digital Signatures with Curve based Diffie Hellman Key Pairs

27:37

The Sleepy Model of Consensus

26:09

Analyzing Multi Key Security Degradation

24:50

Authenticated Encryption in the Face of Protocol and Side Channel Leakage

22:53

Grover Meets Simon - Quantumly Attacking the FX construction

51:25

IACR Business Meeting

23:42

Consolidating Inner product Masking

24:42

Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms

26:58

How to use Metaheuristics for Design of Symmetric Key primitives

26:13

A Subversion-Resistant SNARK

34:27

Combinatorics in Information theoretic cryptography

22:50

Quantum Multicollision Finding Algorithm

27:19

Instantaneous Decentralized Poker

25:55

Faster Algorithms for Isogeny Problems using Torsion Point Images

31:03

Overlaying Conditional Circuit Clauses for Secure Computation

19:06

An Efficient Quantum Collision Search Algorithm and Implications on Symmetric Cryptography

24:03

More Efficient Universal Circuit Constructions

29:02

The first thorough side channel hardware trojan

29:35

A simple and compact algorithm for SIDH with arbitrary degree isogenies

19:41

Amortizing Randomness Complexity in Private Circuits

24:22

Full state keyed duplex with built in multi user support

18:36

The Minimum Number of Cards in Practical Card based Protocols

19:52

Linear Time Zero Knowledge Proofs for Arithmetic Circuit Satisfiability

19:02

Improved Security for OCB3

34:27

White-box Cryptomania, Pascal Paillier

30:03

Zero Knowledge Arguments for Lattice-Based PRFs and applications to e-cash

24:14

JIMU Faster LEGO based Secure Computation using Additive Homomorphic Hashes

27:57

The Iterated Random Function Problem

26:10

Symmetrically and Asymmetrically Hard Cryptography

18:10

Efficient Scalable Constant Round MPC via Garbled Circuits

23:44

An Existential Unforgeable Signature Scheme based on Multivariate Quadratic Equations

18:30

Low Cost Constant Round MPC Combining BMR and Oblivious Transfer

21:50

Revisiting the Expected Cost of Solving uSVP and Applications to LWE

28:15

Yoyo Tricks with AES

51:51

The ship has sailed: the NIST Post-Quantum Cryptography "competition"

21:34

Coded BKW with Sieving

19:28

Linear Cryptanalysis of DES with Asymmetries

23:22

On the Depth of Oblivious Parallel RAM

18:24

Identification Protocols and Signature Schemes Based on Supersingular Isogeny Problems

24:38

Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE

0:37

ABE with Tag Made Easy Concise Framework and New Instantiations in Prime order Groups

29:25

Post Quantum Security of Fiat Shamir

20:22

Adaptive Oblivious Transfer with Access Control from Lattice Assumptions

21:12

New Key Recovery Attacks on Minimal Two Round Even Mansour Ciphers

25:09

Strengthening Access Control Encryption

22:56

An Efficient Pairing Based Shuffle Argument

25:20

Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead

27:13

Towards a Classification of Non interactive Computational Assumptions in Cyclic Groups

18:27

Large Modulus Ring LWE ^= Module LWE

28:14

Automatic Search of Bit Based Division Property for ARX Ciphers and Word Based Division Property

24:36

Collisions and Semi Free Start Collisions for Round Reduced RIPEMD 160

20:04

Opening remarks at Asiacrypt 2017

27:57

Sharper Bounds in Lattice-Based Cryptography Using the Rényi Divergence

23:18

Access Control Encryption for General Policies from Standard Assumptions

31:58

Quantum Fully Homomorphic Encryption with Verification

19:59

Homomorphic Encryption for Arithmetic of Approximate Numbers

21:50

Kummer for Genus One over Prime Order Fields

24:15

Efficient Ring Signatures in the Standard Model

21:21

Improved Conditional Cube Attacks on Keccak Keyed Modes with MILP Method

7:34

Program Chair's Report by Jonathan Katz

7:23

Blockchains and consensus protocols Snake oil warning

5:03

Browser Security with a Grain of Salt

4:00

Delegatable Anonymous Credentials from Mercurial Signatures

4:35

Constraint Hiding Constrained PRFs for Any Circuit from Standard Lattice Assumptions

10:57

Forty years and still running

3:50

From Single Key to Collusion Resistant Secret Key Functional Encryption by Leveraging Succinctness

5:36

How not to pay with Bitcoin

2:50

Indistinguishability Obfuscation for All Circuits from Secret Key Functional Encryption

9:45

IACR Award Ceremony

4:27

Implementing Provably Secure Detection of Direct Injection Attacks