20:09

On the Indifferentiability of Key-Alternating Ciphers

IACR

19:34

How to Run Turing Machines on Encrypted Data

IACR

19:46

Learning with Rounding, Revisited - New Reduction, Prope ...

IACR

18:33

Practical Multilinear Maps over the Integers

IACR

19:25

Sieve-in-the-Middle: Improved MITM Attacks

IACR

18:27

Plain versus Randomized Cascading-Based Key-Length Exten ...

IACR

16:24

Secure Signatures and Chosen Ciphertext Security in a Qu ...

IACR

18:48

Quantum One-Time Programs - (Extended Abstract)

IACR

18:00

Practical Bootstrapping in Quasilinear Time

IACR

17:13

Construction of Differential Characteristics in ARX Desi ...

IACR

16:53

Functional Encryption: New Perspectives and Lower Bounds

IACR

19:05

Optimal Coding for Streaming Authentication and Interact ...

IACR

11:39

Fast Cut-and-Choose Based Protocols for Malicious and Co ...

IACR

21:18

SNARKs for C: Verifying Program Executions Succinctly an ...

IACR

24:03

Counter-Cryptanalysis

IACR

18:44

Efficient Multiparty Protocols via Log-Depth Threshold F ...

IACR

16:28

On the Achievability of Simulation-Based Security for Fu ...

IACR

24:34

Real Time Cryptanalysis of Bluetooth Encryption with Con ...

IACR

18:39

Digital Signatures with Minimal Overhead from Indifferen ...

IACR

19:40

A Uniform Min-Max Theorem with Applications in Cryptography

IACR

19:45

Encoding Functions with Constant Online Rate or How to C ...

IACR

23:16

Homomorphic Encryption from Learning with Errors: Concep ...

IACR

19:18

The Mix-and-Cut Shuffle: Small-Domain Encryption Secure ...

IACR

21:26

Leakage-Resilient Symmetric Cryptography under Empirical ...

IACR

18:13

Full Domain Hash from (Leveled) Multilinear Maps and Ide ...

IACR

17:45

What Information Is Leaked under Concurrent Composition?

IACR

19:44

An Algebraic Framework for Diffie-Hellman Assumptions

IACR

19:48

Achieving the Limits of the Noisy-Storage Model Using En ...

IACR

17:39

Programmable Hash Functions in the Multilinear Setting

IACR

19:09

Everlasting Multi-party Computation

IACR

18:34

Limits on the Power of Cryptographic Cheap Talk

IACR

18:36

Secret Sharing, Rank Inequalities and Information Inequa ...

IACR

19:17

Secure Computation against Adaptive Auxiliary Information

IACR

18:27

Hard-Core Predicates for a Diffie-Hellman Problem over F ...

IACR

17:53

Non-malleable Codes from Two-Source Extractors

IACR

11:25

Accuracy-Privacy Tradeoffs for Two-Party Differentially ...

IACR

19:29

Hardness of SIS and LWE with Small Parameters

IACR

17:59

Limits of Provable Security for Homomorphic Encryption

IACR

17:19

Instantiating Random Oracles via UCEs

IACR

17:08

On Fair Exchange, Fair Coins and Fair Sampling

IACR

16:09

Improved OT Extension for Transferring Short Secrets

IACR

18:07

New Techniques for SPHFs and Efficient One-Round PAKE Pr ...

IACR

18:38

Attribute-Based Encryption for Circuits from Multilinear ...

IACR

20:40

Time-Optimal Interactive Proofs for Circuit Evaluation

IACR

22:56

Highly-Scalable Searchable Symmetric Encryption with Sup ...

IACR