Abstract
This paper describes a new method in pairing-based signature schemes for identifying the invalid digital signatures in a batch after batch verification has failed. The method more efficiently identifies non-trivial numbers, w, of invalid signatures in constrained sized, N, batches than previously published methods, and does not require that the verifier possess detailed knowledge of w. Our method uses “divide-and-conquer” search to identify the invalid signatures within a batch, pruning the search tree to reduce the number of pairing computations required. The method prunes the search tree more rapidly than previously published techniques and thereby provides performance gains for batch sizes of interest.
We are motivated by wireless systems where the verifier seeks to conserve computations or a related resource, such as energy, by using large batches. However, the batch size is constrained by how long the verifier can delay batch verification while accumulating signatures to verify.
We compare the expected performance of our method (for a number of different signature schemes at varying security levels) for varying batch sizes and numbers of invalid signatures against earlier methods. We find that our new method provides the best performance for constrained batches, whenever the number of invalid signatures is less than half the batch size. We include recently published methods based on techniques from the group-testing literature in our analysis. Our new method consistently outperforms these group-testing based methods, and substantially reduces the cost (> 50%) when w ≤ N/4.
The views and conclusions contained in this paper are those of the author and should not be interpreted as representing the official policies, either expressed or implied, of the Army Research Laboratory, or the U. S. Government.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arazi, B.: Certification of dl/ec keys. Submission to P1363 (August 1998) (updated May 1999), http://grouper.ieee.org/groups/1363/StudyGroup/Hybrid.html
Bellare, M., Garay, J., Rabin, T.: Fast batch verification for modular exponentiation and digital signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 236–250. Springer, Heidelberg (1998)
Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514–532. Springer, Heidelberg (2001)
Brown, D., Gallant, R., Vanstone, S.: Provably secure implicit certificate schemes. In: Syverson, P.F. (ed.) FC 2001. LNCS, vol. 2339, pp. 105–120. Springer, Heidelberg (2001)
Camenisch, J., Hohenberger, S., Pedersen, M.: Batch verification of short signatures. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 246–263. Springer, Heidelberg (2007)
Cha, J., Cheon, J.: An identity-based signature from gap diffie-hellman groups. In: Desmedt, Y. (ed.) PKC 2003. LNCS, vol. 2567, pp. 18–30. Springer, Heidelberg (2002)
Devegili, A.J., hÉigeartaigh, C.O., Scott, M., Dahab, R.: Multiplication and squaring on pairing-friendly fields. Technical report, Cryptology ePrint Archive, Report 2006/471 (2006), http://eprint.iacr.org/2006/471
Du, D., Hwang, F.K.: Combinatorial Group Testing And Its Applications, 2nd edn. World Scientific, Singapore (December 1999)
Ferrara, A.L., Green, M., Hohenberger, S., Pedersen, M.O.: Practical short signature batch verification. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol. 5473, pp. 309–324. Springer, Heidelberg (2009)
Fiat, A.: Batch RSA. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 175–185. Springer, Heidelberg (1989)
FIPS 186-2: Digital Signature Standard (DSS). Federal Information Processing Standards Publication 186-2 (January 2000)
Granger, R., Page, D., Smart, N.P.: High security pairing-based cryptography revisited. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 480–494. Springer, Heidelberg (2006)
Granger, R., Smart, N.P.: On computing products of pairings. Cryptology ePrint Archive, Report 2006/172 (2006), http://eprint.iacr.org/2006/172
Hwang, F.K.: A method for detecting all defective members in a population by group testing. Journal of the American Statistical Association 67(339) (1972)
Law, L., Matt, B.J.: Finding invalid signatures in pairing-based batches. In: Galbraith, S. (ed.) Cryptography and Coding 2007. LNCS, vol. 4887, pp. 35–53. Springer, Heidelberg (2007)
Lee, S., Cho, S., Choi, J., Cho, Y.: Batch verification with DSA-type digital signatures for ubiquitous computing. In: Hao, Y., et al. (eds.) CIS 2005. LNCS (LNAI), vol. 3802, pp. 125–130. Springer, Heidelberg (2005)
Lee, S., Cho, S., Choi, J., Cho, Y.: Efficient identification of bad signatures in RSA-type batch signature. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E89-A(1), 74–80 (2006)
Matt, B.J.: Identification of multiple invalid signatures in pairing-based batched signatures. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 337–356. Springer, Heidelberg (2009)
Matt, B.J.: Identification of multiple invalid signatures in pairing-based batched signatures. Cryptology ePrint Archive Report 2009/097 (2009), http://eprint.iacr.org/2009/097
Matt, B.J.: Identification of multiple invalid pairing-based signatures in constrained batches. Cryptology ePrint Archive (2010), http://eprint.iacr.org/2010
Naccache, D., M’Raihi, D., Vaudenay, S., Raphaeli, D.: Can D.S.A. be improved? complexity trade-offs with the Digital Signature Standard. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 77–85. Springer, Heidelberg (1995)
Pastuszak, J., Michalek, D., Pieprzyk, J., Seberry, J.: Identification of bad signatures in batches. In: Santis, A.D. (ed.) PKC 2000. LNCS, vol. 1751, pp. 28–45. Springer, Heidelberg (2000)
Pintsov, L., Vanstone, S.: Postal revenue collection in the digital age. In: Frankel, Y. (ed.) FC 2000. LNCS, vol. 1962, pp. 105–120. Springer, Heidelberg (2000)
Shanks, D.: Class number, a theory of factorization and genera. In: Symposium on Pure Mathematics, vol. 20, pp. 415–440. AMS, Providence (1971)
Solinas, J.: Identity-based digital signature algorithms. In: 7th Workshop on Elliptic Curve Cryptography, ECC 2003 (August 2003) (invited talk)
Stanek, M.: Attacking LCCC batch verification of RSA signatures. Cryptology ePrint Archive, Report 2006/111 (2006), http://eprint.iacr.org/2006/111
Yen, S., Laih, C.: Improved digital signature suitable for batch verification. IEEE Transactions on Computers 44(7), 957–959 (1995)
Yi, X.: An identity-based signature scheme from the weil pairing. IEEE Communications Letters 7(2) (Feburary 2003)
Yoon, H., Cheon, J.H., Kim, Y.: Batch verifications with ID-based signatures. In: Park, C.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol. 3506, pp. 223–248. Springer, Heidelberg (2005)
Zaverucha, G., Stinson, D.: Group testing and batch verification. In: Kurosawa, K. (ed.) ITCS 2009. LNCS, vol. 5973, pp. 140–157. Springer, Heidelberg (2010)
Zhang, C., Lu, R., Lin, X., Ho, P.H., Shen, X.: An efficient identity-based batch verification scheme for vehicular sensor networks. In: The 27th IEEE International Conference on Computer Communications, INFOCOM 2008 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Matt, B.J. (2010). Identification of Multiple Invalid Pairing-Based Signatures in Constrained Batches. In: Joye, M., Miyaji, A., Otsuka, A. (eds) Pairing-Based Cryptography - Pairing 2010. Pairing 2010. Lecture Notes in Computer Science, vol 6487. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17455-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-17455-1_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17454-4
Online ISBN: 978-3-642-17455-1
eBook Packages: Computer ScienceComputer Science (R0)