Secure server-aided signature generation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1992, Issue , 2001, Pages 383-401

  Jakobsson, Markus ^a   Wetzel, Susanne ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Batch; Delegation; DSS; Duplication; Error detection

Indexed keywords

AUTHENTICATION; CHROMIUM COMPOUNDS; COMPUTATION THEORY; COMPUTATIONAL METHODS; ERROR DETECTION;

BATCH; COMPUTATIONAL COSTS; COMPUTATIONAL TASK; DELEGATION; DUPLICATION; EFFICIENCY IMPROVEMENT; EXPONENTIATIONS; SIGNATURE GENERATION;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84937432284     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44586-2_28     Document Type: Conference Paper

References (35)

1. M. Abadi, J. Feigenbaum and J. Kilian, “On Hiding Information from an Oracle”, Journal of Computer and System Sciences, Vol. 39, no. 1, Aug 1989, pp. 21–50.
2. D. Beaver, J. Feigenbaum and V. Shoup, “Hiding Instances in Zero-Knowledge Proof Systems,” CRYPTO’90, pp. 326–338.
3. M. Bellare, J.A. Garay and T. Rabin, “Fast Batch Verification for Modular Exponentiation and Digital Signatures,” EUROCRYPT’98, 1998, pp. 236–250.
4. M. Ben-Or, S. Goldwasser and A. Wigderson, “Completeness Theorems for Noncryptographic Fault-Tolerant Distributed Computations”, STOC’88, pp. 1–10.
5. D. Bleichenbacher, “Addition Chains for Large Sets”, preprint, 1999.
6. J. Bos and M. Coster, “Addition Chain Heuristics,” CRYPTO’89, pp. 400–407.
7. V. Boyko, M. Peinado and R. Venkatesan, “Speeding up discrete log and factoring based schemes via precomputations. EUROCRYPT’98, pp. 221–235.
8. S. Brands, “Untraceable Off-line Cash in Wallet with Observers,” CRYPTO’93, pp. 302–318.
9. J. Burns and C.J. Mitchell, “Parameter Selection for Server-Aided RSA Computation Schemes” IEEE Transactions on Computers, Vol. 43, No. 2, 1994, pp. 163–174.
10. D. Chaum, C. Crépeau and I. Damgård, “Multiparty Unconditionally Secure Protocols”, STOC’98, pp. 11–19.
11. R. Canetti, U. Feige, O. Goldreich and M. Naor, “Adaptively Secure Multi-Party Computation”, STOC’96, pp. 639–648.
12. J.H. Conway and N.J.A. Sloane, “Sphere Packings, Lattices and Groups”, Springer, 1993.
13. M.J. Coster, B.A. LaMacchia, A.M. Odlyzko, C.P. Schnorr and J. Stern, “Improved Low-Density Subset Sum Algorithms”, Journal of Computational Complexity, Vol. 2, 1992, pp. 111–128.
14. A. De Santis, Y. Desmedt, Y. Frankel and M. Yung, “How to Share a Function Securely”, STOC’94, pp. 522–533.
15. Y. Desmedt and K. Kurosawa, “How to Break a Practical MIX and Design a New One,” EUROCRYPT’00, pp. 557–772.
16. J. Feigenbaum and R. Ostrovsky, “A Note on One-Prover Instance-Hiding, Zero- Knowledge Proof Systems”, ASIACRYPT’91, pp. 352–359.
17. M.R. Garey and D.S. Johnson, “Computers and Intractability: A Guide to the Theory of NP-Completeness,” W.H. Freeman and Company, 1979.
18. R. Gennaro, M. Rabin and T. Rabin, “Simplified VSS and Fast-track Multiparty Computations with Applications to Threshold Cryptography”, PODC’98, pp. 101–111.
19. O. Goldreich, S. Micali and A. Wigderson, “How to Play Any Mental Game”, STOC’87, pp. 218–229.
20. M. Jakobsson, “A Practical Mix”, EUROCRYPT’98, pp. 448–461.
21. S. Kawamura and A. Shimbo, “Fast Server-Aided Secret Computation Protocols for Modular Exponentiation”, IEEE Journal on Selected Areas in Communications, Vol. 11, No. 5, 1993, pp. 778–784.
22. C.H. Lim and P.J. Lee, “Security and Performance of Server-Aided RSA Computation Protocols,” CRYPTO’95, pp. 70–83.
23. C.H. Lim and P.J. Lee, “More Flexible Exponentiation With Precomputation”, CRYPTO’94, pp. 95–107.
24. T. Matsumoto, H. Imai, C.S. Laih and S.M. Yen, “On Verifiable Implicit Asking Protocols for RSA Computation”, AUSCRYPT’92, pp. 296–307.
25. T. Matsumoto, K. Kato and H. Imai, “Speeding Up Secret Computations with Insecure Auxiliary Devices”, CRYPTO’88, pp. 497–506.
26. National Institute of Standards and Technology (NIST), “FIPS Publication 186-1: Digital Signature Standard”, December 15, 1998.
27. P. Nguyen and J. Stern, “The Hardness of the Hidden Subset Sum Problem and its Cryptographic Implications”, Crypto’99, pp. 31–46.
28. B. Pfitzmann and M. Waidner, “Attacks on Protocols for Server-Aided RSA Computation”, EUROCRYPT’92, pp. 153–162.
29. J.-J. Quisquater and M. De Soete, “Speeding up Smart Card RSA Computation with Insecure Coprocessors”, SMART CARD 2000, 1989, pp. 191–197.
30. E.M. Rains and N.J.A. Sloane, “Table of Constant Weight Binary Codes”, http://www.research.att.com/˜njas/codes/Andw/, 2000.
31. T. Sander, A. Young and M. Yung, “Non-Interactive Crypto Computing for NC1”, FOCS’99, pp. 554–567.
32. C.-P. Schnorr, “Efficient Signature Generation for Smart Cards,” Journal of Cryptology, Vol. 4, 1991, pp. 161–174.
33. C.P. Schnorr and M. Euchner, “Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems”, Mathematical Programming 66, 1994, pp. 181–199.
34. C.P. Schnorr and H.H. Hörner, “Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction”, EUROCRYPT’95, pp. 1–12.
35. A.C. Yao, “Protocols for Secure Computations”, FOCS’82, pp. 160–164.