default search action
ASIACRYPT 2013: Bengaluru, India
- Kazue Sako, Palash Sarkar:
Advances in Cryptology - ASIACRYPT 2013 - 19th International Conference on the Theory and Application of Cryptology and Information Security, Bengaluru, India, December 1-5, 2013, Proceedings, Part II. Lecture Notes in Computer Science 8270, Springer 2013, ISBN 978-3-642-42044-3
Message Authentication Codes
- Gaëtan Leurent, Thomas Peyrin, Lei Wang:
New Generic Attacks against Hash-Based MACs. 1-20 - Jian Guo, Yu Sasaki, Lei Wang, Shuang Wu:
Cryptanalysis of HMAC/NMAC-Whirlpool. 21-40
Signatures
- Fabien Laguillaumie, Adeline Langlois, Benoît Libert, Damien Stehlé:
Lattice-Based Group Signatures with Logarithmic Signature Size. 41-61 - Özgür Dagdelen, Marc Fischlin, Tommaso Gagliardoni:
The Fiat-Shamir Transformation in a Quantum World. 62-81 - Foteini Baldimtsi, Anna Lysyanskaya:
On the Security of One-Witness Blind Signature Schemes. 82-99
Cryptography Based Upon Physical Assumptions
- Ivan Damgård, Alessandra Scafuro:
Unconditionally Secure and Universally Composable Commitments from Physical Assumptions. 100-119 - Kai-Min Chung, Jonathan Katz, Hong-Sheng Zhou:
Functional Encryption from (Small) Hardware Tokens. 120-139 - Ivan Damgård, Sebastian Faust, Pratyay Mukherjee, Daniele Venturi:
Bounded Tamper Resilience: How to Go beyond the Algebraic Barrier. 140-160 - Aggelos Kiayias, Yiannis Tselekounis:
Tamper Resilient Circuits: The Adversary at the Gates. 161-180
Multi-Party Computation
- Martin Hirt, Daniel Tschudi:
Efficient General-Adversary Multi-Party Computation. 181-200 - Gilad Asharov, Yehuda Lindell, Hila Zarosim:
Fair and Efficient Secure Multiparty Computation with Reputation Systems. 201-220 - Ashish Choudhury, Jake Loftus, Emmanuela Orsini, Arpita Patra, Nigel P. Smart:
Between a Rock and a Hard Place: Interpolating between MPC and FHE. 221-240
Cryptographic Primitives
- Brett Hemenway, Rafail Ostrovsky:
Building Lossy Trapdoor Functions from Lossy Encryption. 241-260 - Yu Yu, Xiangxue Li, Jian Weng:
Pseudorandom Generators from Regular One-Way Functions: New Constructions with Improved Parameters. 261-279 - Dan Boneh, Brent Waters:
Constrained Pseudorandom Functions and Their Applications. 280-300 - Rosario Gennaro, Daniel Wichs:
Fully Homomorphic Message Authenticators. 301-320
Analysis, Cryptanalysis and Passwords
- Daniel J. Bernstein, Tanja Lange:
Non-uniform Cracks in the Concrete: The Power of Free Precomputation. 321-340 - Daniel J. Bernstein, Yun-An Chang, Chen-Mou Cheng, Li-Ping Chou, Nadia Heninger, Tanja Lange, Nicko van Someren:
Factoring RSA Keys from Certified Smart Cards: Coppersmith in the Wild. 341-360 - Jeremiah Blocki, Manuel Blum, Anupam Datta:
Naturally Rehearsing Passwords. 361-380
Leakage-Resilient Cryptography
- Baodong Qin, Shengli Liu:
Leakage-Resilient Chosen-Ciphertext Secure Public-Key Encryption from Hash Proof System and One-Time Lossy Filter. 381-400 - Shweta Agrawal, Yevgeniy Dodis, Vinod Vaikuntanathan, Daniel Wichs:
On Continual Leakage of Discrete Log Representations. 401-420
Two-Party Computation
- Yehuda Lindell, Kobbi Nissim, Claudio Orlandi:
Hiding the Input-Size in Secure Two-Party Computation. 421-440 - Luís T. A. N. Brandão:
Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique - (Extended Abstract). 441-463
Hash Functions
- Aleksandar Kircanski, Riham AlTawy, Amr M. Youssef:
A Heuristic for Finding Compatible Differential Paths with Application to HAS-160. 464-483 - Florian Mendel, Thomas Peyrin, Martin Schläffer, Lei Wang, Shuang Wu:
Improved Cryptanalysis of Reduced RIPEMD-160. 484-503 - Mitsugu Iwamoto, Thomas Peyrin, Yu Sasaki:
Limited-Birthday Distinguishers for Hash Functions - Collisions beyond the Birthday Bound Can Be Meaningful. 504-523 - Tuomas Kortelainen, Juha Kortelainen:
On Diamond Structures and Trojan Message Attacks. 524-539
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.