Abstract
The aim of this paper is to present a signature scheme in which the ability to sign messages of a signer is limited to a fixed number k of signatures. It is an identity-based signature scheme in which each signature can be used only once. We called such schemes “bounded life-span”. It is based on mental games and it uses zero-knowledge tools. A validation center is needed to initialize this identity-based scheme. A credential center is used to insure the unicity and the bounded life-span aspects. It allows delegation and numerous practical applications.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Abadi, M. Burrows, C. Kaufman and B. Lampson. Authentication and delegation with smart cards. Science of Computer Programming, No 21, pp. 93–113, Elsevier, 1993.
M. Bellare and S. Micali. How to sign given any trapdoor function. Proceedings of the 20 th Symposium on Theory of Computing, STOC’90, pp. 427–437.
M. V. D. Burmester. Recent developments in efficient Zero-Knowledge proofs. Talk given at the Université Catholique de Louvain, June 1993.
J. Boyar, D. Chaum, I. Damgard and T. Pedersen. Convertible Undeniable Signatures. Advances in cryptology, Proceedings of CRYPTO’ 90, Lecture Notes in Computer Science, No 537, pp. 189–205, Springer-Verlag, 1991.
M. V. D. Burmester and Y. G. Desmedt. Remarks on Soundness of Proofs. Electronic letters, pp. 1509–1510, Vol. 25, No 22, 26th October 1989.
M. Ben-Or, S. Goldwasser, J. Killian and A. Wigderson. Multi-prover interactive proofs: How to remove intractability assumptions. Proceedings of the twentieth annual ACM Symp. Theory of Computing, STOC’88, pp. 113–131, May 2–4, 1988.
G. do Crescenzo and G. Persiano. Round-optimal perfect zero-knowledge proofs. Information Processing Letters, pp. 93–99, Vol. 50, No 2, 22 April 1994.
D. Chaum and H. van Antwerpen. Undeniable Signatures. Advances in cryptology, Proceedings of CRYPTO’ 89, Lecture Notes in Computer Science, No 435, pp. 212–216, Springer-Verlag, 1990.
Y. Desmedt and Y. Frankel. Shared Generation of Authenticators and Signatures. Advances in cryptology, Proceedings of CRYPTO’ 91, Lecture Notes in Computer Science, No 576, pp. 457–469, Springer-Verlag, 1992.
W. Diffie and M. E. Hellman. New Directions in Cryptography. IEEE Transactions on Information Theory, Vol. IT-22, No 6, pp. 644–654, 1976.
O. Delos and J.-J. Quisquater. Efficient multi-signature schemes for cooperating entities. Proceedings of French-Israeli Workshop on Algebraic Coding, Lecture Notes in Computer Science, No 781, pp. 63–74, Springer-Verlag, 1994.
O. Delos and J.-J. Quisquater. Biauthentication and secret message transmission. Manuscript UCL 1994.
D. de Waleffe and J.-J. Quisquater. Better login protocols for computer networks. Proceedings of ESORICS’ 90, pp. 163–172, October 1990.
U. Feige, A. Fiat and A. Shamir. Zero-knowledge proofs of identity. Journal of Cryptology, 1(2), pp. 77–94, 1988.
L. C. Guillou, M. Davio and J.-J. Quisquater Public-key techniques: Randomness and Redundancy. Cryptologia, Vol. 13, No 2, pp. 167–189, April 1989.
O. Goldreich and H. Krawczyk. On the Composition of Zero-Knowledge Proof Systems. Technical Report No 570 of Technion, 1989.
S. Goldwasser, S. Micali and R. Rivest. A digital signature scheme secure against adaptative chosen-message attacks. Siam J. Comput., 1988, Vol. 17, pp. 281–308.
S. Goldwasser, S. Micali and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. Siam J. Comput., 1989, Vol. 18, No 1, pp. 186–208.
L. C. Guillou and J.-J. Quisquater. Efficient digital public-key signatures with shadow. Advances in cryptology, Proceedings of CRYPTO’ 87, Lecture Notes in Computer Science, No 304, p. 223, Springer-Verlag, 1988.
L.C. Guillou and J.-J. Quisquater. A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory. In C. G. Günther, editor, Advances in Cryptology, Proceedings of EUROCRYPT’ 88, Lecture Notes in Computer Science, No 330, pp. 123–128, Springer-Verlag, 1988.
L.C. Guillou and J.-J. Quisquater. A “paradoxical” identity-based signature scheme resulting from zero-knowledge. Advances in Cryptology, Proceedings of CRYPTO’ 88, Lecture Notes in Computer Science, No 403, pp. 216–231, Springer-Verlag, 1989.
L. C. Guillou, M. Ugon and J.-J. Quisquater. The Smart Card: A Standardized Security Device Dedicated to Public Cryptology. Contemporary Cryptology: The Science Information Integrity, edited by G. J. Simmons, IEEE Press, 1991.
S. Haber and W.S. Stornetta. How to Time-Stamp a Digital Document. Advances in Cryptology, Proceedings of CRYPTO’ 90, Lecture Notes in Computer Science, No 537, pp. 437–455, Springer-Verlag, 1991.
L. Lamport. Password Authentication With Insecure Communication. Comm. of ACM, Vol. 24, No 11, pp. 770–772, Nov. 1981.
K. Mc Curley. Odd and ends from cryptology and computational number theory. Cryptology and computational number theory, edited by C. Pomerance, AMS short course, pp. 145–166, 1990.
R. C. Merkle. A Certified Digital Signature. Advances in Cryptology, Proceedings of CRYPTO’ 89, Lecture Notes in Computer Science, No 435, pp. 218–238, Springer-Verlag, 1989.
M. Naor and M. Yung. Universal One-way Hash Functions and their Cryptographic Applications. Proceedings of the 21 st Symposium on Theory of Computing, STOC’89, pp. 33–43, 1989.
J.-J. Quisquater. Secret distribution of keys for public-key system. Advances in cryptology, Proceedings of CRYPTO’ 87, Lecture Notes in Computer Science, No 293, pp. 203–208, Springer-Verlag, 1987.
M. O. Rabin. Probabilistic algorithms for testing primality. Journal on Number Theory, Vol. 12, pp. 128–138, 1980.
A. Shamir. Identity-based cryptosystems and signatures schemes. Advances in cryptology, Proceedings of CRYPTO’ 84, Lecture Notes in Computer Science, No 196, pp. 47–53, Springer-Verlag, 1985.
A. Shamir, R. Rivest and L. Adleman. Mental Poker. The Mathematical Gardner, edited by D. A. Klarner, Wadsworth International, 1981.
S. Vaudenay. Mémoire de Magistère de Mathématiques Fondamentales et Appliquées et d’Informatique. GRECC, Laboratoire d’Informatique de l’Ecole Normale Supérieure, Paris, 1993.
E. van Heijst. Special Signature Schemes. Thesis for the degree of Doctor at the Eindhoven University of Technology (The Netherlands), July 1992.
M. Waidner and B. Pfitzmann. The Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with computationally Secure Serviceability. Advances in cryptology, Proceedings of EUROCRYPT’ 89, Lecture Notes in Computer Science, No 434, p.690, Springer-Verlag, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Delos, O., Quisquater, JJ. (1994). An Identity-Based Signature Scheme with Bounded Life-Span. In: Desmedt, Y.G. (eds) Advances in Cryptology — CRYPTO ’94. CRYPTO 1994. Lecture Notes in Computer Science, vol 839. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48658-5_10
Download citation
DOI: https://doi.org/10.1007/3-540-48658-5_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58333-2
Online ISBN: 978-3-540-48658-9
eBook Packages: Springer Book Archive