Strict Polynomial-Time in Simulation and Extraction
- 1 January 2004
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 33 (4), 783-818
- https://doi.org/10.1137/s0097539703427975
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many RoundsSIAM Journal on Computing, 2002
- Foundations of CryptographyPublished by Cambridge University Press (CUP) ,2001
- Approximating Minimum-Size k-Connected Spanning Subgraphs via MatchingSIAM Journal on Computing, 2000
- Multiple NonInteractive Zero Knowledge Proofs Under General AssumptionsSIAM Journal on Computing, 1999
- On the Composition of Zero-Knowledge Proof SystemsSIAM Journal on Computing, 1996
- How To Construct Constant-Round Zero-Knowledge Proof Systems for NPJournal of Cryptology, 1996
- Certifying Permutations: Noninteractive Zero-Knowledge Based on Any Trapdoor PermutationJournal of Cryptology, 1996
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Zero-knowledge proofs of identityJournal of Cryptology, 1988
- RSA and Rabin Functions: Certain Parts are as Hard as the WholeSIAM Journal on Computing, 1988