Efficient digital signatures from RSA without random oracles

DOI10.1016/J.INS.2019.09.084zbMath1456.94112OpenAlexW2978995927WikidataQ127184950 ScholiaQ127184950MaRDI QIDQ1999174

Jae Hong Seo

Publication date: 18 March 2021

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2019.09.084

zbMATH Keywords

RSAstandard modeldigital signaturesprime-number generation

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Programmable hash functions and their applications
• Confined guessing: new signatures from standard assumptions
• Short signatures from Diffie-Hellman: realizing almost compact public key
• Space Efficient Signature Schemes from the RSA Assumption
• Improved Security for Linearly Homomorphic Signatures: A Generic Framework
• Digital Signatures from Strong RSA without Prime Generation
• SPHINCS: Practical Stateless Hash-Based Signatures
• Homomorphic Signatures for Polynomial Functions
• Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
• Homomorphic Network Coding Signatures in the Standard Model
• Short Signatures from Weaker Assumptions
• Short and Stateless Signatures from the RSA Assumption
• A Storage Efficient Redactable Signature in the Standard Model
• New Generation of Secure and Practical RSA-Based Signatures
• Redactable Signatures for Tree-Structured Data: Definitions and Constructions
• Realizing Hash-and-Sign Signatures under Standard Assumptions
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• A method for obtaining digital signatures and public-key cryptosystems
• Secure Hash-and-Sign Signatures Without the Random Oracle
• The Cramer-Shoup Strong-RSA Signature Scheme Revisited

This page was built for publication: Efficient digital signatures from RSA without random oracles