Efficient Proofs that a Committed Number Lies in an Interval
Top Cited Papers
- 12 May 2000
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 431-444
- https://doi.org/10.1007/3-540-45539-6_31
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Self-certified public keysPublished by Springer Nature ,2001
- Separability and Efficiency for Generic Group Signature SchemesLecture Notes in Computer Science, 1999
- Efficient Publicly Verifiable Secret Sharing Schemes with Fast or Delayed RecoveryLecture Notes in Computer Science, 1999
- A new public-key cryptosystem as secure as factoringLecture Notes in Computer Science, 1998
- Easy come — Easy go divisible cashLecture Notes in Computer Science, 1998
- A practical and provably secure scheme for publicly verifiable secret sharing and its applicationsPublished by Springer Nature ,1998
- Statistical zero knowledge protocols to prove modular polynomial relationsPublished by Springer Nature ,1997
- Random oracles are practicalPublished by Association for Computing Machinery (ACM) ,1993
- Efficient signature generation by smart cardsJournal of Cryptology, 1991
- Gradual and Verifiable Release of a Secret (Extended Abstract)Lecture Notes in Computer Science, 1988