18:04

Hierarchical Identity Based Encryption from Affine Messafe Authentication

IACR

17:10

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

IACR

18:28

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

IACR

18:50

Breaking '128-bit Secure' Supersingular Binary Curves

IACR

20:28

Leakage-Tolerant Computation with Input-Independent Preprocessing

IACR

21:38

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

IACR

18:22

On Virtual Grey Box Obfuscation for General Circuits

IACR

20:55

How to Use Bitcoin to Design Fair Protocols

IACR

19:43

Scalable Zero Knowledge via Cycles of Elliptic Curves

IACR

16:08

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

IACR

19:01

Physical Zero-Knowledge Proofs of Physical Properties

IACR

16:56

Cryptography with Streaming Algorithms

IACR

18:02

Dishonest Majority Multi-Party Computation for Binary Circuits

IACR

19:02

RSA Key Extraction via Low-Bandwidth Acoustic Cryptanalysis

IACR

17:06

Cryptography from Compression Functions: The UCE Bridge to the ROM

IACR

19:02

Improved Short Lattice Signatures in the Standard Model

IACR

19:01

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

IACR

19:02

The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator

IACR

18:56

Low Overhead Broadcast Encryption from Multilinear Maps

IACR

18:19

New and Improved Key-Homomorphic Pseudorandom Functions

IACR

15:32

Related-Key Security for Pseudorandom Functions Beyond the Linear Barrier

IACR

19:58

Homomorphic Signatures with Efficient Verification for Polynomial Functions

IACR

19:05

Structure-Preserving Signatures from Type II Pairings

IACR

17:21

Indistinguishability Obfuscation and UCEs: The Case of Computationally Unpredictable Sources

IACR

18:02

Optimal Non-perfect Uniform Secret Sharing Schemes

IACR

56:43

IACR Distinguished Lecture: Caught in Between Theory and Practice

IACR

46:37

Invited Talk: How to delegate computations: the power of no-signaling proofs

IACR

19:27

Secure Multi-Party Computation with Identifiable Abort

IACR

18:00

Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings

IACR

18:38

Security of Symmetric Encryption against Mass Surveillance

IACR

17:29

Minimizing the Two-Round Even-Mansour Cipher

IACR

17:00

Converting Cryptographic Schemes from Symmetric to Asymmetric Bilinear Groups

IACR

18:19

The Exact PRF-Security of NMAC and HMAC

IACR

19:01

Round-Efficient Black-Box Construction of Composable Multi-Party Computation

IACR

19:23

Algorithms in HElib

IACR

19:21

Interactive Proofs under Continual Memory Leakage

IACR

18:20

Quantum Position Verification in the Random Oracle Model

IACR

18:35

Faster Bootstrapping with Polynomial Error

IACR

17:08

Updates on Generic Attacks against HMAC and NMAC

IACR

18:16

Security Analysis of Multilinear Maps over the Integers

IACR

18:44

Proving the TLS Handshake Secure (As It Is)

IACR

17:51

Automated Analysis of Cryptographic Assumptions in Generic Group Models

IACR

16:03

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

IACR

19:12

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

IACR

17:51

Amplifying Privacy in Privacy Amplification

IACR

20:49

Hardness of k-LWE and Applications in Traitor Tracing

IACR

20:21

Non-Interactive Secure Multiparty Computation

IACR

15:06

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

IACR

16:12

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

IACR

18:21

Maliciously Circuit-Private FHE

IACR

16:41

Improved Generic Attacks against Hash-Based MACs and HAIFA

IACR

18:31

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

IACR

18:57

The Security of Multiple Encryption in the Ideal Cipher Model

IACR