Iterated Random Oracle: A Universal Approach for Finding Loss in Security Reduction
From MaRDI portal
Publication:2953795
DOI10.1007/978-3-662-53890-6_25zbMath1407.94115OpenAlexW2557037377MaRDI QIDQ2953795
Jianchang Lai, Willy Susilo, Fuchun Guo, Yi Mu, Rongmao Chen, Guomin Yang
Publication date: 6 January 2017
Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://ro.uow.edu.au/cgi/viewcontent.cgi?article=7541&context=eispapers
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient IBE scheme with tight security reduction in the random oracle model
- A variant of Boneh-Franklin IBE with a tight reduction in the random oracle model
- The twin Diffie-Hellman problem and applications
- Secure integration of asymmetric and symmetric encryption schemes
- Efficient signature schemes with tight reductions to the Diffie-Hellman problems
- Tightly CCA-Secure Encryption Without Pairings
- Tightly-Secure Signatures from Lossy Identification Schemes
- Tightly Secure Signatures and Public-Key Encryption
- Tightly-Secure Signatures from Chameleon Hash Functions
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Miniature CCA2 PK Encryption: Tight Security Without Redundancy
- Practical Identity-Based Encryption Without Random Oracles
- New directions in cryptography
- Tighter Reductions for Forward-Secure Signature Schemes
- Making the Diffie-Hellman Protocol Identity-Based
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Identity-Based Encryption Without Random Oracles
- A Practical and Tightly Secure Signature Scheme Without Hash Function
- An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
- The Twin Diffie-Hellman Problem and Applications
- Efficient Identity-Based Encryption with Tight Security Reduction
- Topics in Cryptology – CT-RSA 2005
- Advances in Cryptology - ASIACRYPT 2003
