default search action
ASIACRYPT 2017: Hong Kong, China
- Tsuyoshi Takagi, Thomas Peyrin:
Advances in Cryptology - ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017, Proceedings, Part III. Lecture Notes in Computer Science 10626, Springer 2017, ISBN 978-3-319-70699-3
Asiacrypt 2017 Award Paper II
- Behzad Abdolmaleki, Karim Baghery, Helger Lipmaa, Michal Zajac:
A Subversion-Resistant SNARK. 3-33
Cryptographic Protocols
- Jiang Zhang, Yu Yu:
Two-Round PAKE from Approximate SPH and Instantiations from Lattices. 37-67 - Eike Kiltz, Julian Loss, Jiaxin Pan:
Tightly-Secure Signatures from Five-Move Identification Protocols. 68-94 - Shuichi Katsumata:
On the Untapped Potential of Encoding Predicates by Arithmetic Circuits and Their Applications. 95-125 - Julia Kastner, Alexander Koch, Stefan Walzer, Daiki Miyahara, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone:
The Minimum Number of Cards in Practical Card-Based Protocols. 126-155
Foundations
- Zvika Brakerski, Yael Tauman Kalai, Renen Perlman:
Succinct Spooky Free Compilers Are Not Black Box Sound. 159-180 - Shai Halevi, Yuval Ishai, Abhishek Jain, Ilan Komargodski, Amit Sahai, Eylon Yogev:
Non-Interactive Multiparty Computation Without Correlated Randomness. 181-211 - Ran Canetti, Oxana Poburinnaya, Mariana Raykova:
Optimal-Rate Non-Committing Encryption. 212-241 - Rex Fernando, Peter M. R. Rasmussen, Amit Sahai:
Preventing CLT Attacks on Obfuscation with Linear Overhead. 242-271
Zero-Knowledge Proofs
- Saikrishna Badrinarayanan, Sanjam Garg, Yuval Ishai, Amit Sahai, Akshay Wadia:
Two-Message Witness Indistinguishability and Secure Computation in the Plain Model from New Assumptions. 275-303 - Benoît Libert, San Ling, Khoa Nguyen, Huaxiong Wang:
Zero-Knowledge Arguments for Lattice-Based PRFs and Applications to E-Cash. 304-335 - Jonathan Bootle, Andrea Cerulli, Essam Ghadafi, Jens Groth, Mohammad Hajiabadi, Sune K. Jakobsen:
Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability. 336-365
Symmetric Key Designs
- Ivica Nikolic:
How to Use Metaheuristics for Design of Symmetric-Key Primitives. 369-391 - Sarah Miracle, Scott Yilek:
Cycle Slicer: An Algorithm for Building Permutations on Special Domains. 392-416 - Alex Biryukov, Léo Perrin:
Symmetrically and Asymmetrically Hard Cryptography. 417-445 - Yusuke Naito:
Blockcipher-Based MACs: Beyond the Birthday Bound Without Message Length. 446-470
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.