23:57

Private Puncturable PRFs From Standard Lattice Assumptions

20:36

A kilobit hidden SNFS discrete logarithm computation

20:34

How Fast Can Higher Order Masking Be in Software

19:24

Short Stickelberger Class Relations and application to Ideal SVP

24:40

One Shot Verifiable Encryption from Lattices

26:13

Formal Abstractions for Attested Execution Secure Processors

21:46

Short generators without quantum computers the case of multiquadratics

18:59

Concurrently composable security with shielded super polynomial simulators

20:24

Sublinear Zero Knowledge Arguments for RAM Programs

23:05

Unconditional UC Secure Computation with Stronger Malicious PUFs

18:17

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

18:30

Multi Input Inner Product Functional Encryption from Pairings

20:26

On Removing Graded Encodings from Functional Encryption

21:53

Simplifying Design and Analysis of Complex Predicate Encryption Schemes

21:21

Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions

19:27

Random Sampling Revisited Lattice Enumeration with Discrete Pruning

20:38

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

16:01

New Collision Attacks on Round Reduced Keccak

26:54

Conditional Cube Attack on Reduced Round Keccak Sponge Function

20:08

Small CRT Exponent RSA Revisited

21:08

On the Exact Round Complexity of Self Composable Two Party Computation

26:29

Group Based Secure Computation Optimizing Rounds, Communication, and Computation

16:54

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

22:00

Toward Fine Grained Blackbox Separations Between Semantic and Circular Security Notions

22:25

Depth Robust Graphs and Their Cumulative Memory Complexity

21:58

A Note on Perfect Correctness by Derandomization

25:22

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

15:12

A New Structural Differential Property of 5 Round AES

23:17

Cryptography with Updates

26:25

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

23:41

Scrypt is Maximally Memory Hard

14:54

Modifying an Enciphering Scheme after Deployment

22:07

Public Seed Pseudorandom Permutations

24:22

New Impossible Differential Search Tool from Design and Cryptanalysis Aspects

23:26

Boolean Searchable Symmetric Encryption with Worst Case Sub Linear Complexity

20:17

Decentralized Anonymous Micropayments

21:34

Quantum Secure Symmetric Key Cryptography Based on Hidden Shifts

20:12

The Multi User Security of Double Encryption

22:47

Removing the Strong RSA Assumption from Arguments over the Integers

22:07

Patchable Indistinguishability Obfuscation iO for Evolving Software

23:38

Breaking the Sub Exponential Barrier in Obfustopia

22:55

Quantum Authentication and Encryption with Key Recycling

21:43

Cryptanalyses of Candidate Branching Program Obfuscators

23:39

Lattice Based SNARGs and Their Application to More Efficient Obfuscation

23:21

Quantum authentication with key recycling

22:16

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

19:46

0 RTT Key Exchange with Full Forward Secrecy

23:32

Faster Secure Two Party Computation in the Single Execution Setting

25:25

Adaptive partitioning

22:02

Computational integrity with a public random string from quasi linear PCPs

19:23

Hashing Garbled Circuits for Free

28:03

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

18:36

Ad Hoc PSM Protocols Secure Computation without Coordination

1:03:29

Invited talk: Living Between the Ideal and Real Worlds

52:06

Asiacrypt@From 5 pass MQ based identification to MQ based signatures@Ming Shing Chen@Andreas Hülsing

22:59

Structure Preserving Smooth Projective Hashing

26:55

Selective Opening Security from Simulatable Data Encapsulation

22:33

Efficient KDM CCA Secure Public Key Encryption for Polynomial Functions

24:17

Zero Knowledge Accumulators and Set Algebra

13:42

Welcome to Asiacrypt

25:51

Selective Opening Security in the Presence of Randomness Failures

24:36

Asiacrypt@Digital Signatures Based on the Hardness of Ideal Lattice Problems in all Rings

18:25

Adaptive Oblivious Transfer and Generalization

21:52

Asiacrypt@14h45 Collapse binding quantum commitments without random oracles

30:15

From 5 pass MQ based identification to MQ based signatures

25:35

Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption

23:45

On the Security of Supersingular Isogeny Cryptosystems

25:24

A General Polynomial Selection Method and New Asymptotic Complexities for ...

35:44

Faster Fully Homomorphic Encryption: Bootstrapping in less than 0.1 Seconds

1:00:50

The Reality of Cryptographic Deployments on the Internet

15:51

More Powerful and Reliable Second level Statistical Randomness Tests for NIST SP 800-22

25:16

When are Fuzzy Extractors Possible

29:55

Linear Structures Applications to Cryptanalysis of Round Reduced Keccak

24:56

Balloon Hashing A Memory Hard Function Providing Provable Protection Against Sequential attacks

25:30

MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative complexity

22:44

Efficient and Provable White Box Primitives

28:35

Towards Practical Whitebox cryptography Optimizing Efficiency and Space Hardness

39:21

Simpira v2 A Family of Efficient Permutations Using the AES Round Function

1:06:28

Cryptography in Vietnam in the French and American Wars

28:36

Cliptography Clipping the Power of Kleptographic Attacks

19:30

Déjà Q All Over Again Tighter and Broader Reductions of q Type Assumptions

16:53

Efficient IBE with Tight Reduction to Standard Assumption in the Multi challenge Setting;

20:45

How to Generate and use Universal Samplers

28:05

Trick or Tweak On the Insecurity of OTR’s Tweaks

24:15

Universal Forgery and Key Recovery Attacks on ELmD Authenticated Encryption Algorithm

24:56

Statistical Fault Attacks on Nonce Based Authenticated Encryption Schemes

25:00

Authenticated Encryption with Variable Stretch

55:53

Asiacrypt Invited Lecture II Hoeteck Wee, Advances in Functional Encryption

29:59

Nonlinear Invariant Attack –Practical Attack on Full SCREAM, iSCREAM,and Midori64

22:22

Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions

27:32

Towards Tightly Secure Lattice Short Signature and Id Based Encryption

28:49

From Identification to Signatures, Tightly A Framework and Generic Transforms

21:32

How to Obtain Fully Structure Preserving Automorphic Signatures from Structure Preserving ones

54:24

Asiacrypt 2016 Rump Session

38:48

General IACR Business Meeting

24:17

Verifiable Functional Encryption

26:40

Partitioning via Non Linear Polynomial Functions More Compact IBEs from Ideal Lattices and

20:35

NIZKs with an Untrusted CRS Security in the Face of Parameter Subversion

25:46

Multi Key Homomorphic Authenticators

25:51

Multi Input Functional Encryption with Unbounded Message Security