New efficient and secure protocols for verifiable signature sharing and other applications

DOI10.1006/jcss.1999.1685zbMath0961.68014OpenAlexW1985310180MaRDI QIDQ1582011

Rosario Gennaro, Dario Catalano

Publication date: 10 June 2001

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1999.1685

zbMATH Keywords

digital signatureRabin's signaturesverifiable signature sharing

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Network protocols (68M12)

Cites Work

• Probabilistic encryption
• A key distribution system equivalent to factoring
• How to construct constant-round zero-knowledge proof systems for NP
• How to share a function securely
• Low-Exponent RSA with Related Messages
• Homomorphisms of Secret Sharing Schemes: A Tool for Verifiable Signature Sharing
• Publicly Verifiable Secret Sharing
• Robust Threshold DSS Signatures
• New Convertible Undeniable Signature Schemes
• The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
• How to share a secret
• Undeniable Signatures
• Robust and Efficient Sharing of RSA Functions
• A public key cryptosystem and a signature scheme based on discrete logarithms
• The Knowledge Complexity of Interactive Proof Systems
• New directions in cryptography
• Optimistic fair exchange of digital signatures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New efficient and secure protocols for verifiable signature sharing and other applications