Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDASIACRYPT 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 II. Lecture Notes in Computer Science 10625, Springer 2017, ISBN 978-3-319-70696-2
Asiacrypt 2017 Award Paper I
- Sabyasachi Karati, Palash Sarkar:
Kummer for Genus One over Prime Order Fields. 3-32
Pairing-based Protocols
- Jie Chen, Junqing Gong:
ABE with Tag Made Easy - Concise Framework and New Instantiations in Prime-Order Groups. 35-65 - Essam Ghadafi
, Jens Groth:
Towards a Classification of Non-interactive Computational Assumptions in Cyclic Groups. 66-96 - Prastudy Fauzi, Helger Lipmaa, Janno Siim, Michal Zajac:
An Efficient Pairing-Based Shuffle Argument. 97-127 - Giulio Malavolta, Dominique Schröder:
Efficient Ring Signatures in the Standard Model. 128-157
Quantum Algorithms
- Gregor Leander, Alexander May:
Grover Meets Simon - Quantumly Attacking the FX-construction. 161-178 - Akinori Hosoyamada, Yu Sasaki, Keita Xagawa:
Quantum Multicollision-Finding Algorithm. 179-210 - André Chailloux, María Naya-Plasencia, André Schrottenloher:
An Efficient Quantum Collision Search Algorithm and Implications on Symmetric Cryptography. 211-240 - Martin Roetteler, Michael Naehrig, Krysta M. Svore, Kristin E. Lauter:
Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms. 241-270
Elliptic Curves
- Joost Renes, Benjamin Smith:
qDSA: Small and Secure Digital Signatures with Curve-Based Diffie-Hellman Key Pairs. 273-302 - Craig Costello, Hüseyin Hisil:
A Simple and Compact Algorithm for SIDH with Arbitrary Degree Isogenies. 303-329 - Christophe Petit:
Faster Algorithms for Isogeny Problems Using Torsion Point Images. 330-353
Block Chains
- Hamza Abusalah, Joël Alwen, Bram Cohen, Danylo Khilko, Krzysztof Pietrzak, Leonid Reyzin:
Beyond Hellman's Time-Memory Trade-Offs with Applications to Proofs of Space. 357-379 - Rafael Pass, Elaine Shi:
The Sleepy Model of Consensus. 380-409 - Iddo Bentov, Ranjit Kumaresan, Andrew Miller:
Instantaneous Decentralized Poker. 410-440
Multi-party Protocols
- Daniel Günther, Ágnes Kiss, Thomas Schneider:
More Efficient Universal Circuit Constructions. 443-470 - Aner Ben-Efraim, Yehuda Lindell, Eran Omri:
Efficient Scalable Constant-Round MPC via Garbled Circuits. 471-498 - W. Sean Kennedy, Vladimir Kolesnikov, Gordon T. Wilfong:
Overlaying Conditional Circuit Clauses for Secure Computation. 499-528 - Ruiyu Zhu, Yan Huang:
JIMU: Faster LEGO-Based Secure Computation Using Additive Homomorphic Hashes. 529-572
Operating Modes Security Proofs
- Atul Luykx, Bart Mennink, Kenneth G. Paterson:
Analyzing Multi-key Security Degradation. 575-605 - Joan Daemen, Bart Mennink, Gilles Van Assche:
Full-State Keyed Duplex with Built-In Multi-user Support. 606-637 - Ritam Bhaumik, Mridul Nandi:
Improved Security for OCB3. 638-666 - Ritam Bhaumik, Nilanjan Datta, Avijit Dutta, Nicky Mouha, Mridul Nandi:
The Iterated Random Function Problem. 667-697
a service of 
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 2024-07-30 20:50 CEST 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:
