13:42

Welcome to Asiacrypt

IACR

22:16

Universal Composition with Responsive Environments

IACR

28:14

Size-Hiding Computation for Multiple Parties

IACR

21:06

Reactive Garbling Foundation, Instantiation, Application

IACR

27:27

Indistinguishable Proofs of Work or Knowledge

IACR

22:51

How to Circumvent the Two Ciphertext Lower Bound for Linear Garbling Schemes

IACR

23:58

Efficient Public Key Distance Bounding Protocol

IACR

27:07

Constant Round Asynchronous Multi Party Computation Based on One Way Functions

IACR

27:50

A Shuffle Argument Secure in the Generic Model

IACR

29:54

The Kernel Matrix Diffie Hellman Assumption

IACR

33:03

Optimization of LPN Solving Algorithms

IACR

27:10

Cryptographic applications of capacity theory On the optimality of Coppersmith's Method for ...

IACR

22:50

A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors

IACR

28:22

A Tale of Two Shares Why Two Share Threshold Implementation Seems Worthwhile - and Why It Is Not

IACR

31:25

Cryptographic Reverse Firewall via Malleable Smooth Projective Hash Functions

IACR

26:55

Efficient Public-Key Cryptography with Bounded Leakage and Tamper Resilience

IACR

25:07

Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions

IACR

46:52

Side Channel Analysis Protection and Low Latency in Action - Case Study of PRINCE and Midori

IACR

23:34

Characterisation and Estimation of the Key Rank Distribution in the context of side channel ...

IACR

23:51

Taylor Expansion of Maximum Likelihood Attacks for Masked and Shuffled Implementations

IACR

20:10

Unknown-Input Attacks in the Parallel Setting: Improving the Security of the ...

IACR

29:06

A New Algorithm for the Unbalanced Meet in the Middle Problem

IACR

18:12

Applying MILP Method to Searching Integral Distinguishers Based on Division Property for ...

IACR

24:16

Reverse Cycle Walking and Its Applications

IACR

1:07:07

Neal Koblitz, Cryptography in Vietnam in the French and American Wars

IACR

25:19

Iterated Random Oracle A Universal Approach for Finding Loss in Security Reduction

IACR

25:51

Multi Input Functional Encryption with Unbounded Message Security

IACR

25:46

Multi Key Homomorphic Authenticators

IACR

20:35

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

IACR

26:40

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

IACR

24:17

Verifiable Functional Encryption

IACR

38:48

General IACR Business Meeting

IACR

54:24

Asiacrypt 2016 Rump Session

IACR

21:32

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

IACR

28:49

From Identification to Signatures, Tightly A Framework and Generic Transforms

IACR

27:32

Towards Tightly Secure Lattice Short Signature and Id Based Encryption

IACR

22:22

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

IACR

29:59

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

IACR

55:53

Asiacrypt Invited Lecture II Hoeteck Wee, Advances in Functional Encryption

IACR

25:00

Authenticated Encryption with Variable Stretch

IACR

24:56

Statistical Fault Attacks on Nonce Based Authenticated Encryption Schemes

IACR

24:15

Universal Forgery and Key Recovery Attacks on ELmD Authenticated Encryption Algorithm

IACR

28:05

Trick or Tweak On the Insecurity of OTR’s Tweaks

IACR

20:45

How to Generate and use Universal Samplers

IACR

16:53

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

IACR

19:30

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

IACR

28:36

Cliptography Clipping the Power of Kleptographic Attacks

IACR

1:06:28

Cryptography in Vietnam in the French and American Wars

IACR

39:21

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

IACR

28:35

Towards Practical Whitebox cryptography Optimizing Efficiency and Space Hardness

IACR

22:44

Efficient and Provable White Box Primitives

IACR

25:30

MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative complexity

IACR

24:56

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

IACR

29:55

Linear Structures Applications to Cryptanalysis of Round Reduced Keccak

IACR

25:16

When are Fuzzy Extractors Possible

IACR

15:51

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

IACR

1:00:50

The Reality of Cryptographic Deployments on the Internet

IACR

35:44

Faster Fully Homomorphic Encryption: Bootstrapping in less than 0.1 Seconds

IACR

25:24

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

IACR

23:45

On the Security of Supersingular Isogeny Cryptosystems

IACR

25:35

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

IACR

30:15

From 5 pass MQ based identification to MQ based signatures

IACR

21:52

Asiacrypt@14h45 Collapse binding quantum commitments without random oracles

IACR

18:25

Adaptive Oblivious Transfer and Generalization

IACR

24:36

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

IACR

25:51

Selective Opening Security in the Presence of Randomness Failures

IACR

24:17

Zero Knowledge Accumulators and Set Algebra

IACR

22:33

Efficient KDM CCA Secure Public Key Encryption for Polynomial Functions

IACR

26:55

Selective Opening Security from Simulatable Data Encapsulation

IACR

22:59

Structure Preserving Smooth Projective Hashing

IACR