default search action
ASIACRYPT 2016: Hanoi, Vietnam
- Jung Hee Cheon, Tsuyoshi Takagi:
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. Lecture Notes in Computer Science 10032, 2016, ISBN 978-3-662-53889-0
Asiacrypt 2016 Award Papers
- Yosuke Todo
, Gregor Leander
Nonlinear Invariant Attack - Practical Attack on Full SCREAM, iSCREAM, and Midori64. 3-33 - Alexander Russell
Cliptography: Clipping the Power of Kleptographic Attacks. 34-64
Zero Knowledge
- Esha Ghosh, Olga Ohrimenko, Dimitrios Papadopoulos
Zero-Knowledge Accumulators and Set Algebra. 67-100 - Benoît Libert, San Ling
Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption. 101-131
Post Quantum Cryptography
- Ming-Shing Chen, Andreas Hülsing
From 5-Pass MQ -Based Identification to MQ -Based Signatures. 135-165 - Dominique Unruh:
Collapse-Binding Quantum Commitments Without Random Oracles. 166-195 - Vadim Lyubashevsky:
Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings. 196-214
Provable Security
- Olivier Blazy, Céline Chevalier, Paul Germouty:
Adaptive Oblivious Transfer and Generalization. 217-247 - Felix Heuer, Bertram Poettering:
Selective Opening Security from Simulatable Data Encapsulation. 248-277 - Viet Tung Hoang, Jonathan Katz, Adam O'Neill, Mohammad Zaheri:
Selective-Opening Security in the Presence of Randomness Failures. 278-306 - Shuai Han, Shengli Liu, Lin Lyu
Efficient KDM-CCA Secure Public-Key Encryption for Polynomial Functions. 307-338 - Olivier Blazy
Structure-Preserving Smooth Projective Hashing. 339-369
Digital Signature
- Benoît Libert, San Ling
Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions. 373-403 - Xavier Boyen, Qinyi Li:
Towards Tightly Secure Lattice Short Signature and Id-Based Encryption. 404-434 - Mihir Bellare, Bertram Poettering, Douglas Stebila
From Identification to Signatures, Tightly: A Framework and Generic Transforms. 435-464 - Yuyu Wang, Zongyang Zhang, Takahiro Matsuda
How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones. 465-495
Functional and Homomorphic Cryptography
- Dario Fiore, Aikaterini Mitrokotsa
Multi-key Homomorphic Authenticators. 499-530 - Vipul Goyal, Aayush Jain, Adam O'Neill:
Multi-input Functional Encryption with Unbounded-Message Security. 531-556 - Saikrishna Badrinarayanan, Vipul Goyal, Aayush Jain, Amit Sahai:
Verifiable Functional Encryption. 557-587
ABE and IBE
- Nuttapong Attrapadung
Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings. 591-623 - Junqing Gong, Xiaolei Dong, Jie Chen, Zhenfu Cao
Efficient IBE with Tight Reduction to Standard Assumption in the Multi-challenge Setting. 624-654 - Melissa Chase, Mary Maller, Sarah Meiklejohn:
Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions. 655-681 - Shuichi Katsumata, Shota Yamada
Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps. 682-712
Foundation
- Dennis Hofheinz, Tibor Jager, Dakshita Khurana, Amit Sahai, Brent Waters, Mark Zhandry:
How to Generate and Use Universal Samplers. 715-744 - Fuchun Guo
Iterated Random Oracle: A Universal Approach for Finding Loss in Security Reduction. 745-776 - Mihir Bellare, Georg Fuchsbauer, Alessandra Scafuro:
NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion. 777-804
Cryptographic Protocol
- Jan Camenisch, Robert R. Enderlein, Stephan Krenn, Ralf Küsters, Daniel Rausch:
Universal Composition with Responsive Environments. 807-840 - Prastudy Fauzi
A Shuffle Argument Secure in the Generic Model. 841-872 - Handan Kilinç, Serge Vaudenay:
Efficient Public-Key Distance Bounding Protocol. 873-901 - Foteini Baldimtsi, Aggelos Kiayias, Thomas Zacharias
Indistinguishable Proofs of Work or Knowledge. 902-933
Multi-party Computation
- Kazumasa Shinagawa, Koji Nuida
Size-Hiding Computation for Multiple Parties. 937-966 - Carmen Kempka, Ryo Kikuchi, Koutarou Suzuki:
How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes. 967-997 - Sandro Coretti, Juan A. Garay, Martin Hirt, Vassilis Zikas:
Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions. 998-1021 - Jesper Buus Nielsen
Reactive Garbling: Foundation, Instantiation, Application. 1022-1052
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-14 21:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: