Lenient/strict batch verification in several groups

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

Volumn 2200, Issue , 2001, Pages 81-94

  Hoshino, Fumitaka ^a   Abe, Masayuki ^a   Kobayashi, Tetsutaro ^a  

^a NTT CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; SECURITY OF DATA;

BATCH VERIFICATION; COMPUTATIONAL ADVANTAGES; CRYPTOGRAPHIC PRIMITIVES; ELLIPTIC CURVE; MODULAR EXPONENTIATION; ONE-TIME;

EFFICIENCY;

EID: 84947238011     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45439-x_6     Document Type: Conference Paper

References (18)

1. Brands, S.: Untraceable Off-line Cash in Wallet with Observers. In Stinson, D., ed.: Advances in Cryptology — CRYPTO’93. Volume 773 of Lecture Notes in Computer Science., Berlin; Heidelberg; New York, Springer-Verlag (1993) 302–318
2. Sako, K., Kilian, J.: Receipt-Free Mix-Type Voting Scheme — A practical solution to the implementation of a voting booth —. In Guillou, L.C., Quisquater, J.J., eds.: Advances in Cryptology—EUROCRYPT’95. Volume 921 of Lecture Notes in Computer Science., Berlin; Heidelberg; New York, Springer-Verlag (1995) 393–403
3. Abe, M.: Universally verifiable mix-net with verification work independent of the number of mix-servers. In Nyberg, K., ed.: Advances in Cryptology — EUROCRYPT’ 98. Volume 1403 of Lecture Notes in Computer Science., Berlin; Heidelberg; New York, Springer-Verlag (1998) 437–447
4. Abe, M.: Mix-networks on Permutation Networks. In Lam, K., Okamoto, E., Xing, C., eds.: Advances in Cryptology — ASIACRYPT’99. Volume 1716 of Lecture Notes in Computer Science., Berlin; Heidelberg; New York, Springer-Verlag (1999) 258–273
5. Abe, M., Hoshino, F.: Remarks on mix-network based on permutation network. In Kim, K., ed.: Public Key Cryptography 4thInternational Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001. Volume 1992 of Lecture Notes in Computer Science., Berlin; Heidelberg; New York, Springer-Verlag (2001) 317–324
6. Naccache, D., M’Räıhi, D., Vaudenay, S., Raphaeli, D.: Can D.S.A be Improved ? - Complexity Trade-Offs with the Digital Signature Standard -. In Santis, A.D., ed.: Advances in Cryptology — EUROCRYPT’94. Volume 950 of Lecture Notes in Computer Science., Berlin; Heidelberg; New York, Springer-Verlag (1995) 77–85
7. Sung-Ming Yen, Chi-Sung Laih: Improved Digital Signature Suitable for Batch Verification. IEEE Transactions on Computers 44 (July 1995) 957–959
8. Bellare, M., Garay, J.A., Rabin, T.: Fast Batch Verification for Modular Exponentiation and Digital Signatures. In Nyberg, K., ed.: Advances in Cryptology — EUROCRYPT’98. Volume 1403 of Lecture Notes in Computer Science., Berlin; Heidelberg; New York, Springer-Verlag (1998) 236–250
9. Boyd, C., Pavlovski, C.: Attacking and Repairing Batch Verification Schemes. In Okamoto, T., ed.: Advances in Cryptology — ASIACRYPT2000. Volume 1976 of Lecture Notes in Computer Science., Berlin; Heidelberg; New York, Springer- Verlag (2000) 58–71
10. Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of applied cryptography. CRC Press (1997)
11. Okamoto, T.: Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes. In Brickell, E.F., ed.: Advances in Cryptology — CRYPTO’92. Volume 740 of Lecture Notes in Computer Science., Berlin; Heidelberg; New York, Springer-Verlag (1993) 31–53
12. Cohen, H., Miyaji, A., Ono, T.: Efficient Elliptic Curve Exponentiation Using Mixed Coordinates. In Ohta, K., Pei, D., eds.: Advances in Cryptology — ASIACRYPT’ 98. Volume 1514 of Lecture Notes in Computer Science., Berlin; Heidelberg; New York, Springer-Verlag (1998) 51–65
13. NIST: Recommended Elliptic Curves for Federal Government Use (1999) (available at http://csrc.nist.gov/csrc/fedstandards.html/).
14. Seroussi, C.: Compact Representation of Elliptic Curve Points over IF2n (April 1998) Research Manuscript, Hewlett-Packard Laboratories,.
15. Koblitz, N.: CM-Curves with Good Cryptographic Properties. In Feigenbaum, J., ed.: Advances in Cryptology — CRYPTO’91. Volume 576 of Lecture Notes in Computer Science., Berlin; Heidelberg; New York, Springer-Verlag (1992) 279–287
16. Kobayashi, T., Morita, H., Kobayashi, K., Hoshino, F.: Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic. In Stern, J., ed.: Advances in Cryptology — EUROCRYPT’99. Volume 1592of Lecture Notes in Computer Science., Berlin; Heidelberg; New York, Springer-Verlag (1999) 176–189 (A preliminary version was written in Japanese and presented at SCIS’99-W4-1.4).
17. Knuth, D.E.: Seminumerical Algorithms. Third edn. Volume 2of The Art of Computer Programming. Addison Wesley (1997)
18. IEEE P1363/D13 (Draft Version 13): Standard Specifications for Public Key Cryptography Annex E(Informative) Formats (1999) (available at http:// grouper.ieee.org/groups/1363/P1363/draft.html).