Abstract
Alice wants to prove that she is young enough to borrow money from her bank, without revealing her age. She therefore needs a tool for proving that a committed number lies in a specific interval. Up to now, such tools were either inefficient (too many bits to compute and to transmit) or inexact (i.e. proved membership to a much larger interval). This paper presents a new proof, which is both efficient and exact. Here, “efficient” means that there are less than 20 exponentiations to perform and less than 2 Kbytes to transmit. The potential areas of application of this proof are numerous (electronic cash, group signatures, publicly verifiable secret encryption, etc ...).
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
Bao, F.: An Efficient Verifiable Encryption Scheme for Encryption of Discrete Logarithms. Proceedings of CARDIS’98 (1998)
Brickell, E., Chaum, D., Damgård, I., Van de Graaf, J.: Gradual and Verifiable Release of a Secret. Proceedings of CRYPTO’87, LNCS 293 (1988) 156–166
Bellare, M., Rogaway, P.: Random Oracles are Practical: a Paradigm for Designing Efficient Protocols. Proceedings of the First Annual Conference and Communications Security (1993) 62–73
Boudot, F., Traoré, J.: Efficient Publicly Verifiable Secret Sharing Schemes with Fast or Delayed Recovery. Proceedings of the Second International Conference on Information and Communication Security, LNCS 1726 (1999) 87–102
Cramer, R., Damgård, I., Schoenmakers, B.: Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. Proceedings of CRYPTO’94, LNCS 839 (1997) 174–187
Chaum, D., Evertse, J.-H., Van de Graaf, J.: An Improved Protocol for Demonstrating Possession of Discrete Logarithm and Some Generalizations. Proceedings of EUROCRYPT’87, LNCS 304 (1998) 127–141
Chan, A., Frankel, Y., Tsiounis, Y,: Easy Come-Easy Go Divisible Cash. Proceedings of EUROCRYPT’98, LNCS 1403 (1998) 561–575
Chan, A., Frankel, Y., Tsiounis, Y,: Easy Come-Easy Go Divisible Cash. Updated version with corrections, GTE Tech. Rep. (1998), available at http://www.ccs.neu.edu/home/yiannis/
Camenisch, J., Michels, M.: A Group Signature Scheme Based on an RSA-Variant. Tech. Rep. RS-98-27, BRICS, Dept. of Comp. Sci., University of Aarhus, available at http://www.zurich.ibm.com/~jca/ (1998)
Camenisch, J., Michels, M.: Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes. Proceedings of EUROCRYPT’99, LNCS 1592 (1999) 106–121
Camenisch, J., Michels, M.: Separability and Efficiency for Generic Group Signature Schemes. Proceedings of CRYPTO’99, LNCS 1666 (1999) 413–430
Chaum, D., Pedersen, T.-P.: Wallet Databases with Observers. Proceedings of CRYPTO’92, LNCS 740 (1992) 89–105
Fujisaki, E., Okamoto, T.: Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations. Proceedings of CRYPTO’97, LNCS 1294 (1997) 16–30
Fujisaki, E., Okamoto, T.: A Practical and Provably Secure Scheme for Publicly Verifiable Secret Sharing and Its Applications, Proceedings of EUROCRYPT’98, LNCS 1403 (1998) 32–46
Fiat, A., Shamir, A.: How to Prove Yourself: Practical Solutions to Identification and Signature Problems. Proceedings of CRYPTO’86, LNCS 263 (1986) 186–194
Girault, M.: Self-Certified Public Keys. Proceedings of EUROCRYPT’91, LNCS 547 (1991) 490–497
Mao, W.: Guaranteed Correct Sharing of Integer Factorization with Off-line Shareholders. Proceedings of Public Key Cryptography 98, (1998) 27–42
Okamoto, T., Uchiyama, S.: A New Public-Key Cryptosystem as Secure as Factoring. Proceedings of EUROCRYPT’98, LNCS 1403 (1998) 308–318
Schnorr, C.-P.: Efficient Signature Generation for Smart Cards Journal of Cryptology, (4:3) (1991) 239–252
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boudot, F. (2000). Efficient Proofs that a Committed Number Lies in an Interval. In: Preneel, B. (eds) Advances in Cryptology — EUROCRYPT 2000. EUROCRYPT 2000. Lecture Notes in Computer Science, vol 1807. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45539-6_31
Download citation
DOI: https://doi.org/10.1007/3-540-45539-6_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67517-4
Online ISBN: 978-3-540-45539-4
eBook Packages: Springer Book Archive