48:51

The State of Cryptographic Multilinear Maps

IACR

20:30

Constant Round MPC with Fairness and Guarantee of Output Delivery

IACR

19:32

Efficient Zero Knowledge Proofs of Non Algebraic Statements with Sublinear Amortized Cost

IACR

20:01

Parallel Hashing via List Recoverability

IACR

23:21

Statistical Concurrent Non malleable Zero knowledfe from One way Functions

IACR

16:23

Capacity and Data Complexity in Multidimensional Linear Attack

IACR

20:23

Links Among Impossible Differential, Integral and Zero Correlation Linear Cryptanalysis

IACR

20:58

Tweaking Even Mansour Ciphers

IACR

19:49

Practical Round Optimal Blind Signatures in the Standard Model

IACR

22:42

Secure Computation with Minimal Interaction, Revisited

IACR

18:48

The Iterated Random Permutation Problem with Applications to Cascade Encryption

IACR

18:16

An Algebraic Framework for Pseudorandom Functions and Applications to Related Key Security

IACR

21:53

Efficient Constant Round Multi Party Computation Combining BMR and SPDZ

IACR

18:39

Constant Round Concurrent Zero knowledge from Indistinguishability Obfuscation

IACR

22:15

Indistinguishability Obfuscation from Compact Functional Encryption

IACR

17:38

Known key Distinguisher on Full PRESENT

IACR

18:00

Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP

IACR

27:12

Online Authenticated Encryption and its Nonce Reuse Misuse Resistance

IACR

22:09

Bloom Filters in Adversarial Environments

IACR

20:35

Cryptanalysis of the Co ACD Assumption

IACR

21:57

Arguments of Proximity

IACR

16:35

Bilinear Entropy Expansion from the Decisional Linear Assumption

IACR

18:22

Communication Complexity of Conditional Disclosure of Secrets and Attribute Based Encryption

IACR

26:45

Distributions Attaining Secret Key at a Rate of the Conditional Mutual Information

IACR

23:28

Practical Free Start Collision Attacks on the 76 Step SHA 1

IACR

24:10

Quantum Homomorphic Encryption for Circuits of Low T gate Complexity

IACR

23:05

Incoercible Multi Party Computation and Universally Composable Receipt Free Voting

IACR

20:20

Higher Order Differential Meet in the Middle Preimage Attacks on SHA 1 and BLAKE

IACR

23:45

Decaf Eliminating Cofactors Through Quotients and Isogenies

IACR

27:12

Algebriac Decomposition for Probing Security

IACR

19:44

A Punctured Programming Approach to Adaptive Security in Functional Encryption

IACR

23:13

From Selective to Adaptive Security in Functional Encryption

IACR

24:50

Fast Correlation Attacks over Extension Fields, Large unite Linear Approximation and Cryptoanalysis

IACR

21:36

Secure Computation from Leaky Correlated Randomness

IACR

28:17

Multi Identity and Multi Key Leveled FHE from Learning with Errors

IACR

23:24

Malicious for free OT Extension The Pipe is the Limit

IACR

23:27

Large Scale Secure Computation Multi Party Computation for Parallel RAM Programs

IACR

21:16

Efficient Multi Party Computation, From Passive to Active Security via Secure SIMD Circuits

IACR

23:54

Proofs of Space

IACR

21:55

Predicate Encryption for Circuits from LWE

IACR

24:12

New Attacks on Feistel Structures with Improved Memory Complexities

IACR

22:38

Integral Cryptanalysis on Full MISTY1

IACR

20:13

Explicit Non malleable Codes against Bit wise Tampering adn Permutations

IACR

21:39

Data Is a Stream Security of Stream Based Channels

IACR

36:59

Cryptography, Security, and Public Safety A Policy Perspective

IACR

22:44

Cryptanalysis of the ASASA Cryptosystem with Expanding S boxes

IACR

18:21

Bit Commitment schemes with Non Signaling Adversaries

IACR

23:45

Zeroizing Without Low level Zeroes New Attacks on Multilinear Maps and Thier Limitations

IACR

24:56

The Exact PRF Security of Truncation Tight Bounds for Keyed Sponges and Truncated CBC

IACR

19:31

Programmable Hash Functions go Private Constructions and Applications to Homomorphic Signatures wit

IACR

21:21

PoW Based Distributed Cryptography with no Trusted Setup

IACR

19:57

Efficient Pseudorandom Functions via On the Fly Adaptation

IACR

17:15

Observations on the SIMON Block Cipher Family

IACR

21:33

Multi Key Security The Even Mansour Construction Revisted

IACR

18:58

Implicit Zero Knowledge Arguments and Applications to the Malicious Setting

IACR

20:46

Cryptography with One Way Communication

IACR

27:19

Concurrent Secure Computation with Optimal Query Complexity

IACR

19:49

Concurrent Secure Computation via Non Black Box Simulation

IACR

23:57

A Simpler Variant of Universally Composable Security for Standard Multiparty Computation

IACR

17:41

An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices

IACR

26:08

Almost Optimal Constructions of UOWHFs from 1 to 1, Regular One way Functions and Beyond

IACR