New RSA-Based (Selectively) Convertible Undeniable Signature Schemes

DOI10.1007/978-3-642-02384-2_8MaRDI QIDQ3637135zbMATH OpenOpenAlexFDO

Authors Le Trieu Phong, Kaoru Kurosawa, Wakaha Ogata

Publication date 7 July 2009

Published in Progress in Cryptology – AFRICACRYPT 2009 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02384-2_8

zbMATH Keywords

RSAselective/all conversionstandard modelundeniable signature

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• New Approach for Selectively Convertible Undeniable Signature Schemes
• RSA-based undeniable signatures
• Short and efficient convertible undeniable signature schemes without random oracles
• RSA-based undeniable signatures
• A framework for constructing convertible undeniable signatures

Cites work

• A statistically-hiding integer commitment scheme based on groups with hidden order
• Convertible Undeniable Signatures
• Cryptographically strong undeniable signatures, unconditionally secure for the signer
• Definitions and properties of zero-knowledge proof systems
• Efficient proofs that a committed number lies in an interval
• Generating RSA moduli with a predetermined portion
• scientific article; zbMATH DE number 2079929 (Why is no real title available?)
• scientific article; zbMATH DE number 2081087 (Why is no real title available?)
• Invisibility and anonymity of undeniable and confirmer signatures
• New Approach for Selectively Convertible Undeniable Signature Schemes
• New convertible undeniable signature schemes
• On the exact security of full domain hash
• Programmable Hash Functions and Their Applications
• Public-key cryptosystems based on composite degree residuosity classes
• RSA-based undeniable signatures
• Secure hash-and-sign signatures without the random oracle
• Statistical zero knowledge protocols to prove modular polynomial relations
• The exact security of digital signatures -- how to sign with RSA and Rabin
• The security of the FDH variant of Chaum's undeniable signature scheme
• The Twin Diffie-Hellman Problem and Applications
• Undeniable Signatures

Cited in

(4)

• Relation between verifiable random functions and convertible undeniable signatures, and new constructions
• Which new RSA signatures can be computed from some given RSA signatures?
• A framework for constructing convertible undeniable signatures
• New Approach for Selectively Convertible Undeniable Signature Schemes

This page was built for publication: New RSA-Based (Selectively) Convertible Undeniable Signature Schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637135)