default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDASIACRYPT 2010: Singapore
- Masayuki Abe:
Advances in Cryptology - ASIACRYPT 2010 - 16th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 5-9, 2010. Proceedings. Lecture Notes in Computer Science 6477, Springer 2010, ISBN 978-3-642-17372-1
Hash Attacks
- Dmitry Khovratovich, Ivica Nikolic, Christian Rechberger:
Rotational Rebound Attacks on Reduced Skein. 1-19 - Thomas Fuhr:
Finding Second Preimages of Short Messages for Hamsi-256. 20-37 - Yu Sasaki, Yang Li, Lei Wang, Kazuo Sakiyama, Kazuo Ohta:
Non-full-active Super-Sbox Analysis: Applications to ECHO and Grøstl. 38-55 - Jian Guo
, San Ling, Christian Rechberger, Huaxiong Wang:
Advanced Meet-in-the-Middle Preimage Attacks: First Results on Full Tiger, and Improved Results on MD4 and SHA-2. 56-75 - Onur Özen, Martijn Stam:
Collision Attacks against the Knudsen-Preneel Compression Functions. 76-93
Symmetric-Key Cryptosystems
- Emmanuel Volte, Valérie Nachef, Jacques Patarin:
Improved Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions. 94-111 - François-Xavier Standaert, Nicolas Veyrat-Charvillon, Elisabeth Oswald, Benedikt Gierlichs, Marcel Medwed, Markus Kasper, Stefan Mangard:
The World Is Not Enough: Another Look on Second-Order DPA. 112-129
Block and Stream Ciphers
- Simon Knellwolf, Willi Meier, María Naya-Plasencia:
Conditional Differential Cryptanalysis of NLFSR-Based Cryptosystems. 130-145 - Xiutao Feng, Jun Liu, Zhaocun Zhou, Chuankun Wu, Dengguo Feng:
A Byte-Based Guess and Determine Attack on SOSEMANUK. 146-157 - Orr Dunkelman, Nathan Keller, Adi Shamir:
Improved Single-Key Attacks on 8-Round AES-192 and AES-256. 158-176
Protocols
- Aniket Kate, Gregory M. Zaverucha, Ian Goldberg:
Constant-Size Commitments to Polynomials and Their Applications. 177-194 - Carmit Hazay, Tomas Toft:
Computationally Secure Pattern Matching in the Presence of Malicious Adversaries. 195-212 - Emiliano De Cristofaro, Jihye Kim, Gene Tsudik:
Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model. 213-231
Key Exchange
- Tibor Jager, Florian Kohlar, Sven Schäge, Jörg Schwenk:
Generic Compilers for Authenticated Key Exchange. 232-249 - Eric Brier, Thomas Peyrin:
A Forward-Secure Symmetric-Key Derivation Protocol - How to Improve Classical DUKPT. 250-267
Foundation
- Kai-Min Chung, Feng-Hao Liu, Chi-Jen Lu, Bo-Yin Yang:
Efficient String-Commitment from Weak Bit-Commitment. 268-282 - Robert Granger:
On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields. 283-302 - Marc Fischlin, Anja Lehmann, Thomas Ristenpart, Thomas Shrimpton, Martijn Stam, Stefano Tessaro:
Random Oracles with(out) Programmability. 303-320
Zero-Knowledge
- Jens Groth:
Short Pairing-Based Non-interactive Zero-Knowledge Arguments. 321-340 - Jens Groth:
Short Non-interactive Zero-Knowledge Proofs. 341-358 - Alon Rosen, Abhi Shelat:
Optimistic Concurrent Zero Knowledge. 359-376
Lattice-Based Cryptography
- Damien Stehlé, Ron Steinfeld:
Faster Fully Homomorphic Encryption. 377-394 - S. Dov Gordon, Jonathan Katz, Vinod Vaikuntanathan:
A Group Signature Scheme from Lattice Assumptions. 395-412 - Markus Rückert:
Lattice-Based Blind Signatures. 413-430
Secure Communication and Computation
- Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan:
The Round Complexity of Verifiable Secret Sharing: The Statistical Case. 431-447 - Qiushi Yang, Yvo Desmedt:
General Perfectly Secure Message Transmission Using Linear Codes. 448-465 - Yuval Ishai, Abishek Kumarasubramanian, Claudio Orlandi, Amit Sahai:
On Invertible Sampling and Adaptive Security. 466-482 - Chao Ning, Qiuliang Xu:
Multiparty Computation for Modulo Reduction without Bit-Decomposition and a Generalization to Bit-Decomposition. 483-500
Models, Notions, and Assumptions
- Payman Mohassel:
A Closer Look at Anonymity and Robustness in Encryption Schemes. 501-518 - Sarah Meiklejohn, Hovav Shacham, David Mandell Freeman:
Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures. 519-538 - Tibor Jager, Andy Rupp:
The Semi-Generic Group Model and Applications to Pairing-Based Cryptography. 539-556
Public-Key Encryption
- Vivien Dubois, Nicolas Gama:
The Degree of Regularity of HFE Systems. 557-576 - Melissa Chase, Seny Kamara:
Structured Encryption and Controlled Disclosure. 577-594 - Eike Kiltz, Krzysztof Pietrzak:
Leakage Resilient ElGamal Encryption. 595-612 - Yevgeniy Dodis, Kristiyan Haralambiev, Adriana López-Alt, Daniel Wichs:
Efficient Public-Key Cryptography in the Presence of Key Leakage. 613-631
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-11-08 20:18 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:
