Advances in Cryptology – ASIACRYPT 2016: 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II

Front Matter....Pages I-XXIV
Front Matter....Pages 1-1
Nonlinear Invariant Attack....Pages 3-33
Cliptography: Clipping the Power of Kleptographic Attacks....Pages 34-64
Front Matter....Pages 65-65
Zero-Knowledge Accumulators and Set Algebra....Pages 67-100
Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption....Pages 101-131
Front Matter....Pages 133-133
Collapse-Binding Quantum Commitments Without Random Oracles....Pages 135-165
Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings....Pages 166-195
Front Matter....Pages 196-214
Adaptive Oblivious Transfer and Generalization....Pages 215-215
Selective Opening Security from Simulatable Data Encapsulation....Pages 217-247
Selective-Opening Security in the Presence of Randomness Failures....Pages 248-277
Efficient KDM-CCA Secure Public-Key Encryption for Polynomial Functions....Pages 278-306
Structure-Preserving Smooth Projective Hashing....Pages 307-338
Front Matter....Pages 339-369
Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions....Pages 371-371
Towards Tightly Secure Lattice Short Signature and Id-Based Encryption....Pages 373-403
From Identification to Signatures, Tightly: A Framework and Generic Transforms....Pages 404-434
How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones....Pages 435-464
Front Matter....Pages 465-495
Multi-key Homomorphic Authenticators....Pages 497-497
Multi-input Functional Encryption with Unbounded-Message Security....Pages 499-530
Verifiable Functional Encryption....Pages 531-556
Front Matter....Pages 557-587
Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings....Pages 589-589
Front Matter....Pages 591-623
Efficient IBE with Tight Reduction to Standard Assumption in the Multi-challenge Setting....Pages 589-589
Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions....Pages 624-654
Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps....Pages 655-681
Front Matter....Pages 682-712
How to Generate and Use Universal Samplers....Pages 713-713
Iterated Random Oracle: A Universal Approach for Finding Loss in Security Reduction....Pages 715-744
NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion....Pages 745-776
Front Matter....Pages 777-804
Universal Composition with Responsive Environments....Pages 805-805
A Shuffle Argument Secure in the Generic Model....Pages 807-840
Efficient Public-Key Distance Bounding Protocol....Pages 841-872
Indistinguishable Proofs of Work or Knowledge....Pages 873-901
Front Matter....Pages 902-933
Size-Hiding Computation for Multiple Parties....Pages 935-935
How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes....Pages 937-966
Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions....Pages 967-997
Reactive Garbling: Foundation, Instantiation, Application....Pages 998-1021
Back Matter....Pages 1022-1052
....Pages 1053-1055