Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
- 15 April 1999
- book chapter
- Published by Springer Nature
- p. 107-122
- https://doi.org/10.1007/3-540-48910-x_8
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Wallet Databases with ObserversPublished by Springer Nature ,2001
- An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some GeneralizationsPublished by Springer Nature ,2000
- Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free?Published by Springer Nature ,1998
- Rapid Demonstration of Linear Relations Connected by Boolean OperatorsPublished by Springer Nature ,1997
- Efficient group signature schemes for large groupsPublished by Springer Nature ,1997
- Statistical zero knowledge protocols to prove modular polynomial relationsPublished by Springer Nature ,1997
- Practical zero-knowledge proofs: Giving hints and using deficienciesJournal of Cryptology, 1991
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Demonstrating Possession of a Discrete Logarithm Without Revealing itPublished by Springer Nature ,1987
- Factoring with cyclotomic polynomialsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985