1:03:19

From Idea to Impact, the Crypto Story: What's Next?

IACR

20:00

Dissection BKW

IACR

23:26

Contrained PRFs for NC1 in Traditional Groups

IACR

19:56

Round Optimal Secure Multiparty Computation with Honest Majority

IACR

22:47

Lower Bounds on Lattice Enumeration with Extreme Pruning

IACR

22:39

Multi Theorem Preprocessing NIZKs from Lattices

IACR

24:46

On the Exact Round Complexity of Secure Three Party Computation

IACR

22:48

Yes, There is an Oblivious RAM Lower Bound!

IACR

24:39

Lattice Based Zero Knowledge Arguments for Integer Relations

IACR

23:56

GGH15 Beyond Permutation Branching Programs Proofs, Attacks and Candidates

IACR

20:09

Sub Linear Lattice Based Zero Knowledge Arguments for Arithmetic Circuits

IACR

14:26

Promise Zero Knowledge and its Applications to Round Optimal MPC

IACR

44:09

Crypto: A Key Ingredient to Building Respectful Products

IACR

11:53

Round Optimal Secure Multi Party Computation

IACR

25:35

CAPA The Spirit of Beaver Against Physical Attacks

IACR

25:22

Improved Division Property Based Cube Attacks Exploiting Algebraic Properties of Superpoly

IACR

25:20

Faster Homomorphic Linear Transformations in HElib

IACR

25:08

Hardness of Non Interactive Differential Privacy from One Way Functions & Risky Traitor Tracing and

IACR

24:24

Non Malleable Secret Sharing for General Access Structures

IACR

24:17

On Distributional Collision Resistant Hashing

IACR

23:42

Proofs of Work from Worst Case Assumptions

IACR

23:39

Fast Message Franking From Invisible Salamanders to Encryptment

IACR

23:16

Threshold Cryptosystems From Threshold Fully Homomorphic Encryption

IACR

23:18

Cryptanalysis via Algebraic Spans

IACR

23:15

Berstein Bound on WCS is Tight Repairing Luykx Preneel Optimal Forgeries

IACR

22:37

On Tightly Secure Non Interactive Key Exchange

IACR

22:17

Multi Input Functional Encryption for Inner Products Function Hiding Realizations and Constructions

IACR

22:17

On the Local Leakage Resilience of Linear Secret Sharing Schemes

IACR

22:15

Verifiable Delay Functions

IACR

25:56

Cryptanalyses of Branching Program Obfuscations over GGH13 Multilinear Map from the NTRU Problem

IACR

21:59

Out of Band Authentication in Group Messaging Computational, Statistical, Optimal

IACR

26:03

Correcting Subverted Random Oracles

IACR

21:42

Fast Distributed RSA Key Generation for Semi Honest and Malicious Adversaries

IACR

25:28

Limits of Practical Sublinear Secure Computation

IACR

21:25

Encrypt or Decrypt To Make a Single Key Beyond Birthday Secure Nonce Based MAC

IACR

21:18

Fast Correlation Attack Revisted

IACR

21:15

Generic Attacks Against Beyond Birthday Bound MACs

IACR

25:03

An Optimal Distributed Discrete Log Protocol with Applications to Homomorphic Secret Sharing

IACR

23:06

Practical and Tightly Secure Digital Signatures and Authenticated Key Exchange

IACR

24:53

Amortized Complexity of Information Theoretically Secure MPC Revisted

IACR

21:03

Simplifying Game Based Definitions

IACR

24:47

Quantum FHE Almost As Secure As Classical

IACR

20:46

Rasta A Cipher with Low ANDdepth and Few ANDs per Bit

IACR

20:46

Towards Bidirectional Ratcheted Key Exchange

IACR

24:22

Optimizing Authenticated Garbling for Faster Secure Two Party Computation

IACR

20:30

Non Uniform Bounds in the Random Permutation, Ideal Cipher, and Generic Group Models

IACR

24:19

Limits on the Power of Garbling Techniques for Public Key Encryption

IACR

24:07

SPDZ2k Efficient MPC mod 2^k for Dishonest Majority

IACR

23:45

Continuously Non Malleable Codes in the Split State Model from Minimal Assumptions

IACR

23:41

Fast Large Scale Honest Majority MPC for Malicious Adversaries

IACR

19:46

The Curse of Small Domains New Attacks on Format Preserving Encryption

IACR

23:37

Private Circuits A Modular Approach

IACR

19:49

Provable Security of Tweakable Block Ciphers Based on Substitution Permutation Networks

IACR

19:45

The Algebraic Group Model and its Applications

IACR

19:48

Optimal Channel Security Against Fine Graine State Compromise The Safety of Messaging

IACR

23:01

Non Malleable Codes for Partial Functions with Manipulation Detection

IACR

22:55

Fast Homomorphic Evaluation of Deep Discretized Neural Networks

IACR

19:16

Trapdoor Functions from the Computational Diffie Hellman Assumption

IACR

22:21

TinyKeys A New Approach to Efficient Multi Party Computation

IACR

22:18

From Laconic Zero Knowledge to Public Key Cryptography

IACR

18:47

Indifferentiable Authenticated Encryption

IACR

21:48

On the Complexity of Compressing Obfuscation

IACR

21:47

Pseudorandom Quantum States

IACR

17:59

Combiners for Backdoored Random Oracles

IACR

21:14

On the Round Complexity of OT Extension

IACR

21:11

A Simple Obfuscation Scheme for Pattern Matching with Wildcards

IACR

21:06

Two Round Multiparty Secure Computation Minimizing Public Key Operations

IACR

21:02

Non Interactive Zero Knowledge Proofs for Composite Statements

IACR

19:56

Must the Communication Graph of MPC Protocols be an Expander

IACR

19:24

A New Public Key Cryptosystem via Mersenne Numbers

IACR

14:55

Searchable Encryption with Optimal Locality Achieving Sublogarithmic Read Efficiency

IACR

17:11

IND CCA secure Key Encapsulation Mechanism in the Quantum Random Oracle Model, Revisited

IACR

16:20

Updatable and Universal Comon Reference Strings with Applications to zk SNARKs

IACR

12:40

A Key recovery Attack on 855 round Trivium

IACR

14:51

Yet Another Compiler for Active Security or Efficient MPC Over Arbitrary Rings

IACR

10:55

Tight Tradeoffs in Searchable Symmetric Encryption

IACR