21:56

Adaptively Secure Garbling with Near Optimal Online Complexity

IACR

22:27

A New Approach to Black-Box Concurrent Secure Computation

IACR

20:55

Obfustopia Built on Secret-Key Functional Encryption

IACR

0:24

too short MTS

IACR

26:36

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

IACR

20:40

On the Existence of Three Round Zero-Knowledge Proofs

IACR

24:24

Statistical Witness Indistinguishability (and more) in Two Messages

IACR

24:06

An Efficiency-Preserving Transformation from ...

IACR

56:58

Thirty Years of Digital Currency: From Digicash to the Blockchain

IACR

24:02

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

IACR

25:22

Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs

IACR

26:34

Supersingular Isogeny Graphs and Endomorphism Rings: Reductions and Solutions

IACR

24:04

Fuzzy Password-Authenticated Key Exchange

IACR

25:31

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

IACR

22:29

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

IACR

25:04

Non-malleable Randomness Encoders and Their Applications

IACR

21:56

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

IACR

26:38

Formal Verification of Masked Hardware Implementations in the Presence of Glitches

IACR

22:13

Masking the GLP Lattice-Based Signature Scheme at Any Order

IACR

29:05

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

IACR

24:55

The Discrete-Logarithm Problem with Preprocessing

IACR

26:27

Simple Proofs of Sequential Work

IACR

24:51

Two-Round Multiparty Secure Computation from Minimal Assumptions

IACR

25:13

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

IACR