21:40

A Formal Treatment of Multi key Channels

IACR

20:42

A New Approach to Round Optimal Secure Multiparty Computation

IACR

23:30

A New Distribution Sensitive Secure Sketch and Popularity Proportional Hashing

IACR

25:14

Joint presentation

IACR

20:29

Amortization with Fewer Equations for Proving Knowledge of Small Secrets

IACR

19:08

Anonymous Attestation with Subverted TPMs

IACR

23:31

Asymptotically Compact Adaptively Secure Lattice IBEs and Verifiable Random Functions via Generalize

IACR

22:54

Be Adaptive, Avoid Overcommitting

IACR

21:58

Bitcoin as a Transaction Ledger A Composable Treatment

IACR

24:28

Black Box Parallel Garbled RAM

IACR

24:24

Boosting Authenticated Encryption Robustness With Minimal Modifications

IACR

25:50

Breaking the FF3 Format Preserving Encryption Standard Over Small Domains

IACR

23:57

Compact Structure Preserving Signatures with Almost Tight Security

IACR

22:35

Conditional Disclosure of Secrets Amplification, Closure, Amortization, Lower bounds, and Separatio

IACR

18:33

Conditional Disclosure of Secrets via Non Linear Reconstruction

IACR

22:50

Cube Attacks on Non Blackbox Polynomials Based on Division Property

IACR

18:56

Degree Evaluation of NFSR Based Cryptosystems

IACR

27:32

Distinguisher Dependent Simulation in Two Rounds and Its Applications

IACR

23:00

Encrypted Davies Meyer and Its Dual Towards Optimal Security Using Mirror Theory

IACR

24:45

Encryption switching protocols revisited switching modulo p

IACR

22:08

Fast Secure Two Party ECDSA Signing

IACR

25:53

Four Round Concurrent Non Malleable Commitments from One Way Functions

IACR

25:31

From Obfuscation to the Security of Fiat Shamir for Proofs

IACR

20:55

Functional Graph Revisited Updates on Second Preimage Attacks on Hash Combiners

IACR

21:26

Gaussian Sampling over the Integers Efficient, Generic, Constant Time

IACR

21:42

Generic Transformations of Predicate Encodings Constructions and Applications

IACR

21:14

Hedging Public Key Encryption in the Real World

IACR

23:06

Identity based Encryption from Codes with Rank Metric

IACR

27:39

Identity Based Encryption from the Diffie Hellman Assumption

IACR

23:57

Incremental Program Obfuscation

IACR

23:25

Indifferentiability of Iterated Even Mansour Ciphers with Non Idealized Key Schedules

IACR

26:18

Indistinguishability Obfuscation for Turing Machines Constant Overhead and Amortization

IACR

24:59

Two papers on Indistinguishability Obfuscation (soft merge)

IACR

22:34

Information theoretic Indistinguishability via the Chi squared Method

IACR

23:31

Insuperability of the Standard Versus Ideal Model Gap for Tweakable Blockcipher Security

IACR

22:49

Key Rotation for Authenticated Encryption

IACR

21:33

Kurosawa Desmedt Meets Tight Security

IACR

23:02

Laconic Oblivious Transfer and its Applications

IACR

20:34

Lower Bounds on Obfuscation from All or Nothing Encryption

IACR

22:40

LPN Decoded

IACR

20:24

Memory Tight Reductions

IACR

22:59

Message Franking via Committing Authenticated Encryption

IACR

20:37

Middle Product Learning With Errors

IACR

25:58

New security notions and feasibility results for authentication of quantum data

IACR

18:35

Non Full Sbox Linearization Applications to Collision Attacks on Round Reduced Keccak

IACR

20:22

Non Malleable Codes for Space Bounded Tampering

IACR

25:29

Optimal Security Reductions for Unique Signatures Bypassing Impossibilities with A Counterexample

IACR

26:43

Ouroboros A Provably Secure Proof of Stake Protocol

IACR

18:12

PRF ODH Relations, Instantiations, and Impossibility Results

IACR

19:12

Practical Functional Encryption for Quadratic Functions with Applications to Predicate Encryption

IACR

15:06

Privacy Free Garbled Circuits for Formulas Size Zero and Information Theoretic

IACR

24:20

Private Multiplication over Finite Fields

IACR

46:05

Prospects for a Quantum Factoring Machine

IACR

25:02

Proving Resistance against Invariant Attacks How to Choose the Round Constants

IACR

25:02

Quantum non malleability and authentication

IACR

25:11

Quantum Security of NMAC and Related Constructions

IACR

21:53

Ratcheted Encryption and Key Exchange The Security of Messaging

IACR

20:54

Robust Non Interactive Multiparty Computation Against Constant Size Collusion

IACR

19:31

Secure Computation based on Leaky Correlations High Resilience Setting

IACR

18:21

Snarky Signatures Minimal Signatures of Knowledge from Simulation Extractable SNARKs

IACR

21:19

Stronger Security for Reusable Garbled Circuits, General Definitions and Attacks

IACR

19:40

Structure vs Hardness through the Obfuscation Lens

IACR

25:56

The Bitcoin Backbone Protocol with Chains of Variable Difficulty

IACR

28:50

The first collision for full SHA 1

IACR

25:13

The Price of Low Communication in Secure Multi Party Computation

IACR

16:14

The TinyTable protocol or Gate scrambling Revisited

IACR

24:23

Time Memory Tradeoff Attacks on the MTP Proof of Work Scheme

IACR

20:14

Topology Hiding Computation on All Graphs

IACR

51:27

Verified Drop in Replacements for TLS&HTTPS

IACR

25:51

Watermarking Cryptographic Functionalities from Standard Lattice Assumptions

IACR

22:49

ZMAC A Fast Tweakable Block Cipher Mode for Highly Secure Message Authentication

IACR