On verifiable implicit asking protocols for RSA computation

DOI10.1007/3-540-57220-1_70MaRDI QIDQ4341696zbMATH OpenFDO

Authors Tsutomu Matsumoto, Chi-Sung Laih, Sung-Ming Yen, Hideki Imai

Publication date 8 December 1997

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57220-1_70

zbMATH Keywords

verifiable implicit asking

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Recommendations

• An active attack on protocols for server-aided RSA signature computation
• Security and performance of server-aided RSA computation protocols
• Some active attacks on fast server-aided secret computation protocols for modular exponentiation
• On the security of server-aided RSA protocols

Cited in

(6)

• Server-aided honest computation for cryptographic applications
• Speeding up exponentiation using an untrusted computational resource
• An active attack on protocols for server-aided RSA signature computation
• Some active attacks on fast server-aided secret computation protocols for modular exponentiation
• Server-Aided Verification Signatures: Definitions and New Constructions
• Provably secure server-aided verification signatures

This page was built for publication: On verifiable implicit asking protocols for RSA computation

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