On the Amortized Complexity of Zero-Knowledge Protocols
- 1 January 2009
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Efficient and Secure Comparison for On-Line AuctionsPublished by Springer Science and Business Media LLC ,2007
- Scalable Secure Multiparty ComputationLecture Notes in Computer Science, 2006
- Black-Box Secret Sharing from Primitive Sets in Algebraic Number FieldsLecture Notes in Computer Science, 2005
- Cryptography in Subgroups of $\mathbb{Z}_{n}^{*}$Lecture Notes in Computer Science, 2005
- Optimal Black-Box Secret Sharing over Arbitrary Abelian GroupsLecture Notes in Computer Science, 2002
- How To Prove Yourself: Practical Solutions to Identification and Signature ProblemsPublished by Springer Science and Business Media LLC ,2000
- Efficient Zero-Knowledge Proofs of Knowledge without Intractability AssumptionsLecture Notes in Computer Science, 2000
- Statistical zero knowledge protocols to prove modular polynomial relationsPublished by Springer Science and Business Media LLC ,1997
- Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian GroupSIAM Journal on Discrete Mathematics, 1994
- The knowledge complexity of interactive proof-systemsPublished by Association for Computing Machinery (ACM) ,1985