17:50

Twisted μ4 normal form for elliptic curves

IACR

19:27

Revisiting Lattice Attacks on overstretched NTRU parameters

IACR

20:49

Computing generator in cyclotomic integer rings

IACR

20:36

A kilobit hidden SNFS discrete logarithm computation

IACR

24:40

One Shot Verifiable Encryption from Lattices

IACR

19:24

Short Stickelberger Class Relations and application to Ideal SVP

IACR

23:57

Private Puncturable PRFs From Standard Lattice Assumptions

IACR

22:37

Constraint hiding constrained PRFs for NC1 from LWE

IACR

22:43

Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model

IACR

21:46

Short generators without quantum computers the case of multiquadratics

IACR

22:56

Robust transforming combiners from indistinguishability obfuscation to functional encryptio

IACR

20:34

How Fast Can Higher Order Masking Be in Software

IACR

20:40

From Minicrypt to Obfustopia via Private Key Functional Encryption

IACR

25:01

Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation From Degre

IACR

22:20

Improved Private Set Intersection against Malicious Adversaries

IACR

26:13

Formal Abstractions for Attested Execution Secure Processors

IACR

18:59

Concurrently composable security with shielded super polynomial simulators

IACR

23:05

Unconditional UC Secure Computation with Stronger Malicious PUFs

IACR

18:17

Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack

IACR

20:24

Sublinear Zero Knowledge Arguments for RAM Programs

IACR

18:30

Multi Input Inner Product Functional Encryption from Pairings

IACR

21:53

Simplifying Design and Analysis of Complex Predicate Encryption Schemes

IACR

20:26

On Removing Graded Encodings from Functional Encryption

IACR

19:27

Random Sampling Revisited Lattice Enumeration with Discrete Pruning

IACR

20:38

On dual lattice attacks against small secret LWE and parameter choices in HElib and SEAL

IACR

20:08

Small CRT Exponent RSA Revisited

IACR

26:54

Conditional Cube Attack on Reduced Round Keccak Sponge Function

IACR

16:01

New Collision Attacks on Round Reduced Keccak

IACR

26:29

Group Based Secure Computation Optimizing Rounds, Communication, and Computation

IACR

21:08

On the Exact Round Complexity of Self Composable Two Party Computation

IACR

20:17

Decentralized Anonymous Micropayments

IACR

22:07

Public Seed Pseudorandom Permutations

IACR

20:12

The Multi User Security of Double Encryption

IACR

22:47

Removing the Strong RSA Assumption from Arguments over the Integers

IACR

16:54

High Throughput Secure Three Party Computation for Malicious Adversaries and an Honest Majo

IACR

21:21

Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions

IACR

1:03:29

Invited talk: Living Between the Ideal and Real Worlds

IACR

14:54

Modifying an Enciphering Scheme after Deployment

IACR

26:25

Separating Semantic and Circular Security for Symmetric Key Bit Encryption from the Learnin

IACR

21:34

Quantum Secure Symmetric Key Cryptography Based on Hidden Shifts

IACR

23:26

Boolean Searchable Symmetric Encryption with Worst Case Sub Linear Complexity

IACR

24:22

New Impossible Differential Search Tool from Design and Cryptanalysis Aspects

IACR

15:12

A New Structural Differential Property of 5 Round AES

IACR

23:17

Cryptography with Updates

IACR

25:22

Fixing Cracks in the Concrete Random Oracles with Auxiliary Input, Revisited

IACR

22:00

Toward Fine Grained Blackbox Separations Between Semantic and Circular Security Notions

IACR

21:58

A Note on Perfect Correctness by Derandomization

IACR

22:25

Depth Robust Graphs and Their Cumulative Memory Complexity

IACR

22:55

Quantum Authentication and Encryption with Key Recycling

IACR

23:21

Quantum authentication with key recycling

IACR

22:16

Relativistic or 2 prover 1 round zero knowledge protocol for NP secure against quantum adve

IACR

25:25

Adaptive partitioning

IACR

19:46

0 RTT Key Exchange with Full Forward Secrecy

IACR

23:32

Faster Secure Two Party Computation in the Single Execution Setting

IACR

28:03

Non Interactive Secure 2PC in the Offline/Online and Batch Settings

IACR

19:23

Hashing Garbled Circuits for Free

IACR

22:02

Computational integrity with a public random string from quasi linear PCPs

IACR

18:36

Ad Hoc PSM Protocols Secure Computation without Coordination

IACR

21:43

Cryptanalyses of Candidate Branching Program Obfuscators

IACR

23:39

Lattice Based SNARGs and Their Application to More Efficient Obfuscation

IACR

23:38

Breaking the Sub Exponential Barrier in Obfustopia

IACR

22:07

Patchable Indistinguishability Obfuscation iO for Evolving Software

IACR

23:41

Scrypt is Maximally Memory Hard

IACR

1:02:27

Invited talk: Advances in computer aided cryptography

IACR