On the Security of Server-Aided RSA Protocols
暂无分享,去创建一个
[1] Victor Shoup,et al. Lower Bounds for Discrete Logarithms and Related Problems , 1997, EUROCRYPT.
[2] Perfect, Generic Pseudo-Randomness for Cyclic Groups , 1998 .
[3] Chae Hoon Lim,et al. Security and Performance of Server-Aided RSA Computation Protocols , 1995, CRYPTO.
[4] V. Nechaev. Complexity of a determinate algorithm for the discrete logarithm , 1994 .
[5] Paul C. van Oorschot,et al. Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude , 1996, CRYPTO.
[6] Douglas R. Stinson,et al. Cryptography: Theory and Practice , 1995 .
[7] Hideki Imai,et al. Speeding Up Secret Computations with Insecure Auxiliary Devices , 1988, CRYPTO.
[8] Jean-Jacques Quisquater,et al. Fast Server-Aided RSA Signatures Secure Against Active Attacks , 1995, CRYPTO.
[9] Richard J. Lipton,et al. Algorithms for Black-Box Fields and their Application to Cryptography (Extended Abstract) , 1996, CRYPTO.
[10] Endre Szemerédi,et al. On the Complexity of Matrix Group Problems I , 1984, FOCS.
[11] Claus-Peter Schnorr. Security of Allmost ALL Discrete Log Bits , 1998, Electron. Colloquium Comput. Complex..
[12] Hideki Imai,et al. On Verifiable Implicit Asking Protocols for RSA Computation , 1992, AUSCRYPT.
[13] Ueli Maurer,et al. Lower Bounds on Generic Algorithms in Groups , 1998, EUROCRYPT.
[14] Birgit Pfitzmann,et al. Attacks on Protocols for Server-Aided RSA Computation , 1992, EUROCRYPT.