Abstract
Essentially all known one-time signature schemes can be described as special instances of a general scheme suggested by Bleichenbacher and Maurer based on “graphs of one-way functions”. Bleichenbacher and Maurer thoroughly analyze graph based signatures from a combinatorial point of view, studying the graphs that result in the most efficient schemes (with respect to various efficiency measures, but focusing mostly on key generation time). However, they do not give a proof of security of their generic construction, and they leave open the problem of determining under what assumption security can be formally proved. In this paper we analyze graph based signatures from a security point of view and give sufficient conditions that allow to prove the security of the signature scheme in the standard complexity model (no random oracles). The techniques used to prove the security of graph based one-time signatures are then applied to the construction of a new class of algebraic signature schemes, i.e., schemes where signatures can be combined with a restricted set of operations.
Supported in part by NSF grant CCR-0093029 and Mideplan Scholarship.
Supported in part by NSF Career Award CCR-0093029.
Chapter PDF
References
M. Abdalla and L. Reyzin. A new forward-secure digital signature scheme. In ASIACRYPT’2000, LNCS 1976, pages 116–129. Springer-Verlag, 2000.
J. N. E. Bos and D. Chaum. Provable unforgeable signatures. In CRYPTO’92, LNCS 740, pages 1–14. Springer-Verlag, 1993.
M. Bellare, J. Kilian, and P. Rogaway. The security of the cipher block chaining message authentication code. In CRYPTO’94, LNCS 839. Springer-Verlag, 1994.
M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudorandom bits. In Siam Journal of Computing, 13(4):850–864, 1984.
M. Bellare and S. Micali. How to sign given any trapdoor function. In Journal of Cryptology, 39(1):214–233, 1992.
D. Bleichenbacher and U. M. Maurer. Directed acyclic graphs, one-way functions and digital signatures. In CRYPTO’94, LNCS 839, pages 75–82. Springer-Verlag, 1994.
D. Bleichenbacher and U. M. Maurer. On the efficiency of one-time digital signatures. In ASIACRYPT’96, LNCS 1163, pages 145–158. Springer-Verlag, 1996.
D. Bleichenbacher and U. M. Maurer. Optimal tree-based one-time digital signature schemes. In STACS’96, LNCS 1046, pages 363–374. Springer-Verlag, 1996.
M. Bellare and S. Miner. A forward-secure digital signature scheme. In CRYPTO’99, LNCS 1666, pages 431–448. Springer-Verlag, 1999.
M. Bellare and G. Neven. Transitive Signatures based on Factoring and RSA In ASIA-CRYPT’02, (these proceedings).
M. Bellare and P. Rogaway. Collision-resistant hashing: Towards making UOWHFs practical. In CRYPTO’97, LNCS 1294, pages 470–484. Springer-Verlag, 1997.
T. H. Cormen, C. E. Leiserson, and R. L. Rivest. In Introduction to algorithms. MIT Press and McGraw-Hill Book Company, 6th ed., 1992.
R. Canetti, D. Micciancio, and O. Reingold. Perfectly one-way probabilistic hash functions. STOC’98, pages 131–140. ACM, 1998.
C. Dwork and M. Naor. An efficient existentially unforgeable signature scheme and its applications. In CRYPTO’94, LNCS 839, pages 234–246. Springer-Verlag, 1994.
S. Even, O. Goldreich, and S. Micali. On-line/off-line digital signatures. In Journal of Cryptology, 9(1):35–67, 1996.
S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. In Siam Journal of Computing, 17(2):281–308, 1988.
R. Hauser, A. Przygienda, and G. Tsudik. Reducing the cost of security in link state routing. In Symposium on Network and Distributed Systems Security (NDSS’ 97), pages 93–99, Internet Society, 1997.
A. Hevia and D. Micciancio. The provable security of Graph-Based One-Time Signatures and extensions to algebraic signature schemes. Full version of this paper, available via http://www-cse.ucsd. edu/users/ahevia.
R. Johnson, D. Molnar, D. Song, and D. Wagner. Homomorphic signature schemes. In CT-RSA’ 2002, LNCS 2271, pages 244–262. Springer-Verlag, 2002.
L. Lamport. Constructing digital signatures from a one way function. Technical Report CSL-98, SRI International, 1979.
R. C. Merkle. In Secrecy, Authentication, and Public Key Systems, vol. 18 of Computer science. Systems programming. UMI Research Press, 1982.
R. C. Merkle. A digital signature based on a conventional encryption function. In CRYPTO’87, LNCS 293, pages 369–378. Springer-Verlag, 1987.
R. C. Merkle. A digital signature based on a conventional encryption function. In CRYPTO’89, LNCS 435, pages 428–446. Springer-Verlag, 1990.
C. H. Meyer and S. M. Matyas. In Cryptography: A New Dimension in Computer Data Security. John Wiley and Sons, New York, 1982.
T. Malkin, D. Micciancio, and S. Miner. Efficient generic forward-secure signatures with an unbounded number of time periods. In EURO-CRYPT’2002, LNCS 2332, pages 400–417. Springer-Verlag, 2002.
S. Micali and R. L. Rivest. Transitive signature schemes. In CT-RSA’ 2002, LNCS 2271, pages 236–243. Springer-Verlag, 2002.
M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. STOC’89, pages 33–43. ACM, 1989
A. Perrig. The BiBa one-time signature scheme and broadcast authentication protocol. In Proceedings of the 8th ACM conference on Computer and Communications Security, pages 28–37. ACM, 2001.
M. O. Rabin. Digitalized signatures. In R. A. DeMillo, D. P. Dobkin, A. K. Jones, and R. J. Lipton, editors, Foundations of Secure Computation, pages 155–168. Academic Press, 1978.
P. Rohatgi. A compact and fast hybrid signature scheme for multicast packet authentication. In Proceedings of the 6th ACM conference on Computer and communications security, pages 93–100, ACM, 1999.
R. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signature and public-key cryptosystems. In Communications of the ACM, 21(2):120–126, 1978.
C. Schnorr. Efficient identification and signatures for smartcards. In CRYPTO’89, LNCS 435, pages 239–252. Springer-Verlag, 1990.
S. Vaudenay. One-time identification with low memory. In Eurocode 92, CISM Courses and Lectures, no. 339, pages 217–228, Springer-Verlag, 1992.
A. Yao. Theory and applications of trapdoor functions. FOCS’82, pages 80–91. IEEE, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hevia, A., Micciancio, D. (2002). The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes. In: Zheng, Y. (eds) Advances in Cryptology — ASIACRYPT 2002. ASIACRYPT 2002. Lecture Notes in Computer Science, vol 2501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36178-2_24
Download citation
DOI: https://doi.org/10.1007/3-540-36178-2_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00171-3
Online ISBN: 978-3-540-36178-7
eBook Packages: Springer Book Archive