Fast server-aided secret computation protocols for modular exponentiation
- 1 June 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 11 (5) , 778-784
- https://doi.org/10.1109/49.223880
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Attacks on Protocols for Server-Aided RSA ComputationPublished by Springer Nature ,2001
- How To Prove Yourself: Practical Solutions to Identification and Signature ProblemsPublished by Springer Nature ,2000
- Factorisation attack on certain server-aided computation protocols for the RSA secret transformationElectronics Letters, 1990
- Speeding Up Secret Computations with Insecure Auxiliary DevicesPublished by Springer Nature ,1990
- On hiding information from an oracleJournal of Computer and System Sciences, 1989
- The knowledge complexity of interactive proof-systemsPublished by Association for Computing Machinery (ACM) ,1985
- Fast decipherment algorithm for RSA public-key cryptosystemElectronics Letters, 1982
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- On the Evaluation of PowersSIAM Journal on Computing, 1976