Batch verification of short signatures

Journal of Cryptology

Volumn 25, Issue 4, 2012, Pages 723-747

  Camenisch, Jan ^a   Hohenberger, Susan ^b   Pedersen, Michael Østergaard ^c  

^a IBM RESEARCH ZURICH   (Switzerland)

^b JOHNS HOPKINS UNIVERSITY   (United States)

^c Miracle A/S   (Denmark)

Author keywords

Batch verification; Bilinear groups; Digital signatures

Indexed keywords

BATCH VERIFICATION; BILINEAR GROUPS; COMMUNICATION APPLICATION; COMMUNICATION OVERHEADS; CRYPTOGRAPHIC PRIMITIVES; PROCESSABLE; PUBLIC-KEY SIGNATURES; SECURE COMMUNICATIONS; SHORT SIGNATURES; SIGNATURE SCHEME; WITHOUT RANDOM ORACLES;

COMMUNICATION; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

AUTHENTICATION;

EID: 84869491744     PISSN: 09332790     EISSN: 14321378     Source Type: Journal    
DOI: 10.1007/s00145-011-9108-z     Document Type: Article

References (56)

1. J. H. An, Y. Dodis, T. Rabin, On the security of joint signature and encryption, in Advances in Cryptology-EUROCRYPT'02, ed. by L. R. Knudsen. Lecture Notes in Computer Science, vol. 2332(Springer, Berlin, 2002), pp. 83-107
2. B. Barak, R. Canetti, J. B. Nielsen, R. Pass, Universally composable protocols with relaxed set-up assumptions, in 45th Symposium on Foundations of Computer Science (FOCS) (IEEE Computer Society, Washington, 2004), pp. 186-195
3. K. Barr, K. Asanović, Energy aware lossless data compression, in MobiSys (USENIX, Berkeley, 2003)
4. M. Bellare, J. A. Garay, T. Rabin, Fast batch verification for modular exponentiation and digital signatures, in Advances in Cryptology-EUROCRYPT'98, ed. by K. Nyberg. Lecture Notes in Computer Science, vol. 1403(Springer, Berlin, 1998), pp. 236-250
5. D. Boneh, X. Boyen. Efficient selective-ID secure identity-based encryption without random oracles, in Advances in Cryptology-EUROCRYPT'04, ed. by C. Cachin, J. Camenisch. Lecture Notes in Computer Science, vol. 3027(Springer, Berlin, 2004), pp. 223-238
6. D. Boneh, X. Boyen. Short signatures without random oracles, in Advances in Cryptology-EUROCRYPT'04, ed. by C. Cachin, J. Camenisch. Lecture Notes in Computer Science, vol. 3027(Springer, Berlin, 2004), pp. 382-400
7. D. Boneh, M. K. Franklin, Identity-based encryption from the Weil pairing, in Advances in Cryptology-CRYPTO'01, ed. by J. Kilian. Lecture Notes in Computer Science, vol. 2139(Springer, Berlin, 2001), pp. 213-229
8. D. Boneh, C. Gentry, B. Lynn, H. Shacham, Aggregate and verifiably encrypted signatures from bilinear maps, in Advances in Cryptology-EUROCRYPT'03, ed. by E. Biham. Lecture Notes in Computer Science, vol. 2656(Springer, Berlin, 2003), pp. 416-432
9. D. Boneh, B. Lynn, H. Shacham, Short signatures from the Weil pairing. J. Cryptol. 17(4), 297-319 (2004)
10. C. Boyd, C. Pavlovski, Attacking and repairing batch verification schemes, in Advances in Cryptology-ASIACRYPT'00, ed. by T. Okamoto. Lecture Notes in Computer Science, vol. 1976(Springer, Berlin, 2000), pp. 58-71
11. X. Boyen, B. Waters, Compact group signatures without random oracles, in Advances in Cryptology-EUROCRYPT'06, ed. by S. Vaudenay. Lecture Notes in Computer Science, vol. 4004(Springer, Berlin, 2006), pp. 427-444
12. J. Camenisch, S. Hohenberger, M.Ø. Pedersen, Batch verification of short signatures, in Advances in Cryptology-EUROCRYPT'07, ed. by M. Naor. Lecture Notes in Computer Science, vol. 4515(Springer, Berlin, 2007), pp. 246-263
13. J. Camenisch, A. Lysyanskaya, Signature schemes and anonymous credentials from bilinear maps, in Advances in Cryptology-CRYPTO'04, ed. by M. K. Franklin. Lecture Notes in Computer Science, vol. 3152(Springer, Berlin, 2004), pp. 56-72
14. R. Canetti, S. Halevi, J. Katz, A forward-secure public-key encryption scheme, in Advances in Cryptology-EUROCRYPT'03, ed. by E. Biham. Lecture Notes in Computer Science, vol. 2656(Springer, Berlin, 2003), pp. 255-271
15. T. Cao, D. Lin, R. Xue, Security analysis of some batch verifying signatures from pairings. Int. J. Netw. Secur. 3(2), 138-143 (2006)
16. Car 2 Car, Communication consortium. http://car-to-car.org
17. J. C. Cha, J. H. Cheon, An identity-based signature from gap Diffie-Hellman groups, in 6th Public Key Cryptography (PKC), ed. by Y. Desmedt. Lecture Notes in Computer Science, vol. 2567(Springer, Berlin, 2003), pp. 18-30
18. S. Chatterjee, P. Sarkar, Trading time for space: Towards an efficient IBE scheme with short (er) public parameters in the standard model, in 8th Information Security and Cryptology (ICISC), ed. by D. Won, S. Kim. Lecture Notes in Computer Science, vol. 3935(Springer, Berlin, 2005), pp. 424-440
19. S. Chatterjee, P. Sarkar, HIBE with short public parameters without random oracle, in Advances in Cryptology-ASIACRYPT'06, ed. by X. Lai. Lecture Notes in Computer Science, vol. 4284(Springer, Berlin, 2006), pp. 145-160
20. L. Chen, Z. Cheng, N. P. Smart, Identity-based key agreement protocols from pairings, 2006. Cryptology ePrint Archive: Report 2006/199
21. J. H. Cheon, Y. Kim, H. J. Yoon, A new ID-based signature with batch verification, 2004. Cryptology ePrint Archive: Report 2004/131
22. J. H. Cheon, D. H. Lee, Use of sparse and/or complex exponents in batch verification of exponentiations. IEEE Trans. Comput. 55(12), 1536-1542 (2006)
23. S. Cui, P. Duan, C. W. Chan, An efficient identity-based signature scheme with batch verifications, in 1st International Conference on Scalable Information Systems (InfoScale), ed. by A. Chowdhury, F. Lau, F. Z. Wang (ACM Press, New York, 2006)
24. W. Diffie, M. Hellman, New directions in cryptography. IEEE Trans. Inf. Theory 22, 644-654 (1976)
25. A. L. Ferrara, M. Green, S. Hohenberger, M.Ø. Pedersen, Practical short signature batch verification, in CT-RSA (2009). Cryptology ePrint Archive: Report 2008/015
26. A. Fiat, Batch RSA, in Advances in Cryptology-CRYPTO'89, ed. by G. Brassard. Lecture Notes in Computer Science, vol. 435(Springer, Berlin, 1989), pp. 175-185
27. S. D. Galbraith, K. G. Paterson, N. P. Smart, Pairings for cryptographers, 2006. Cryptology ePrint Archive: Report 2006/165
28. C. Gentry, How to compress Rabin ciphertexts and signatures (and more), in Advances in Cryptology-CRYPTO'04, ed. by M. K. Franklin. Lecture Notes in Computer Science, vol. 3152(Springer, Berlin, 2004), pp. 179-200
29. C. Gentry, Z. Ramzan, Identity-based aggregate signatures, in 9th Public Key Cryptography (PKC), ed. by M. Yung. Lecture Notes in Computer Science, vol. 3958(Springer, Berlin, 2006), pp. 257-273
30. S. Goldwasser, S. Micali, R. L. Rivest, A digital signature scheme secure against adaptive chosenmessage attacks. SIAM J. Comput. 17 (2) (1988)
31. R. Granger, N. P. Smart, On computing products of pairings, 2006. Cryptology ePrint Archive: Report 2006/172
32. L. Harn, Batch verifying multiple DSA digital signatures. Electron. Lett. 34(9), 870-871 (1998)
33. L. Harn, Batch verifying multiple RSA digital signatures. Electron. Lett. 34(12), 1219-1220 (1998)
34. F. Hoshino, M. Abe, T. Kobayashi, Lenient/strict batch verification in several groups, in 4th Information Security, ed. by G. I. Davida, Y. Frankel. Lecture Notes in Computer Science, vol. 2200(Springer, Berlin, 2001), pp. 81-94
35. M.-S. Hwang, C.-C. Lee, Y.-L. Tang, Two simple batch verifying multiple digital signatures, in 3rd Information and Communications Security (ICICS), ed. by S. Qing, T. Okamoto, J. Zhou. Lecture Notes in Computer Science, vol. 2229(Springer, Berlin, 2001), pp. 233-237
36. M.-S. Hwang, I.-C. Lin, K.-F. Hwang, Cryptanalysis of the batch verifying multiple RSA digital signatures. Informatica 11(1), 15-19 (2000)
37. IEEE. 5.9 GHz Dedicated Short Range Communications. http://grouper.ieee. org/groups/scc32/dsrc
38. N. Koblitz, A. Menezes, Pairing-based cryptography at high security levels, 2005. Cryptology ePrint Archive: Report 2005/076
39. C.-S. Laih, S.-M. Yen, Improved digital signature suitable for batch verification. IEEE Trans. Comput. 44(7), 957-959 (1995)
40. O. Landsiedel, K. Wehrle, S. Götz, Accurate prediction of power consumption in sensor networks, in IEEE Workshop on Embedded Networked Sensors (EmNetS-II) (2005)
41. L. Law, B. J. Matt, Finding invalid signatures in pairing-based batches, in Cryptography and Coding, 11th IMA International Conference, ed. by S. D. Galbraith. Lecture Notes in Computer Science, vol. 4887(Springer, Berlin, 2007), pp. 34-53
42. S. Lee, S. Cho, J. Choi, Y. Cho, Efficient identification of bad signatures in RSA-type batch signature. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E89-A (1), 74-80 (2006)
43. C. Lim, P. Lee, Security of interactive DSA batch verification. Electron. Lett. 30(19), 1592-1593 (1994)
44. C. H. Lim, Efficient multi-exponentation and application to batch verification of digital signatures, 2000. http://dasan. sejong.ac.kr/chlim/ english-pub.html
45. A. Lysyanskaya, R. L. Rivest, A. Sahai, S. Wolf, Pseudonym systems, in 6th Selected Areas in Cryptography (SAC), ed. by C. Adams, H. Heys. Lecture Notes in Computer Science, vol. 1758(Springer, Berlin, 1999), pp. 184-199
46. A. Menezes, S. Vanstone, T. Okamoto, Reducing elliptic curve logarithms to logarithms in a finite field, in 23rd ACM Symposium on Theory of Computing (STOC) (1991), pp. 80-89
47. D. Naccache, Secure and practical identity-based encryption, 2005. Cryptology ePrint Archive: Report 2005/369
48. D. Naccache, D. M'Raïhi, S. Vaudenay, D. Raphaeli, Can DSA be improved? Complexity trade-offs with the digital signature standard, in Advances in Cryptology-EUROCRYPT'94, ed. by A. De Santis. Lecture Notes in Computer Science, vol. 950(Springer, Berlin, 1994), pp. 77-85
49. M. Raya, J.-P. Hubaux, Securing vehicular ad hoc networks. J. Comput. Secur. 15, 39-68 (2007)
50. SeVeCom, Security on the road. http://www.sevecom.org
51. H. Shacham, D. Boneh, Improving SSL handshake performance via batching, in Cryptographer's Track at RSA Conference'01, ed. by D. Naccache. Lecture Notes in Computer Science, vol. 2020(Springer, Berlin, 2001), pp. 28-43
52. M. Stanek, Attacking LCCC batch verification of RSA signatures, 2006. Cryptology ePrint Archive: Report 2006/111
53. B. Waters, Efficient identity-based encryption without random oracles, in Advances in Cryptology-EUROCRYPT'05, ed. by R. Cramer. Lecture Notes in Computer Science, vol. 3494(Springer, Berlin, 2005), pp. 320-329
54. H. J. Yoon, J. H. Cheon, Y. Kim, Batch verifications with ID-based signatures, in 7th Information Security and Cryptology (ICISC), ed. by C. Park, S. Chee. Lecture Notes in Computer Science, vol. 3506(Springer, Berlin, 2004), pp. 233-248
55. F. Zhang, K. Kim, Efficient ID-based blind signature and proxy signature from bilinear pairings, in 8th Information Security and Privacy, Australasian Conference (ACISP), ed. by R. Safavi-Naini, J. Seberry. Lecture Notes in Computer Science, vol. 2727(Springer, Berlin, 2003), pp. 312-323
56. F. Zhang, R. Safavi-Naini, W. Susilo, Efficient verifiably encrypted signature and partially blind signature from bilinear pairings, in Progress in Cryptology-INDOCRYPT'03, ed. by T. Johansson, S. Maitra. Lecture Notes in Computer Science, vol. 2904(Springer, Berlin, 2003), pp. 191-204