Noninteractive Zero-Knowledge
Abstract
MSC codes
Keywords
Get full access to this article
View all available purchase options and get full access to this article.
References
Information & Authors
Information
Published In

Copyright
History
MSC codes
Keywords
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- Zero-KnowledgeEncyclopedia of Cryptography, Security and Privacy | 8 January 2025
- Noninteractive ProofEncyclopedia of Cryptography, Security and Privacy | 8 January 2025
- Doubly-Efficient Batch Verification in Statistical Zero-KnowledgeTheory of Cryptography | 28 November 2024
- From One-Time to Two-Round Reusable Multi-signatures Without Nested ForkingTheory of Cryptography | 30 November 2024
- Trustless privacy-preserving data aggregation on Ethereum with hypercube network topologyComputer Communications, Vol. 230 | 1 Jan 2025
- PTTS: Zero-knowledge proof-based private token transfer system on Ethereum blockchain and its network flow based balance range privacy attack analysisJournal of Network and Computer Applications, Vol. 233 | 1 Jan 2025
- Fiat-Shamir for Proofs Lacks a Proof Even in the Presence of Shared EntanglementQuantum, Vol. 8 | 17 December 2024
- Dilithium-Based Verifiable Timed Signature Scheme2024 17th International Conference on Security of Information and Networks (SIN) | 2 Dec 2024
- A survey on Ethereum pseudonymity: Techniques, challenges, and future directionsJournal of Network and Computer Applications, Vol. 232 | 1 Dec 2024
- AIFL: Ensuring Unlinkable Anonymity and Robust Incentive in Cross-Device Federated LearningIEEE Internet of Things Journal, Vol. 11, No. 22 | 15 Nov 2024
- Efficiency of Zero-Knowledge Proofs: A Through Review and Analysis2024 IEEE International Conference on Public Key Infrastructure and its Applications (PKIA) | 5 Sep 2024
- Temporary relay: A more flexible way to cross chainsPeer-to-Peer Networking and Applications, Vol. 17, No. 5 | 27 July 2024
- When cryptography stops data science: strategies for resolving the conflicts between data scientists and cryptographersData Science and Management, Vol. 7, No. 3 | 1 Sep 2024
- Zero-Knowledge Proof of Distinct Identity: a Standard-compatible Sybil-resistant Pseudonym Extension for C-ITS2024 IEEE Intelligent Vehicles Symposium (IV) | 2 Jun 2024
- How to Redact the Bitcoin Backbone Protocol2024 IEEE International Conference on Blockchain and Cryptocurrency (ICBC) | 27 May 2024
- Managing IoT Data Transmission in Smart Home Environments with Zero-Knowledge Proof Protocol2024 Zooming Innovation in Consumer Technologies Conference (ZINC) | 22 May 2024
- Increasing Trust and Privacy by Using Blockchain Technology in the Onion Router Network2024 11th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO) | 14 Mar 2024
- zkFDL: An efficient and privacy-preserving decentralized federated learning with zero knowledge proof2024 IEEE 3rd International Conference on AI in Cybersecurity (ICAIC) | 7 Feb 2024
- Strong Batching for Non-interactive Statistical Zero-KnowledgeAdvances in Cryptology – EUROCRYPT 2024 | 29 April 2024
- NIZKs with Maliciously Chosen CRS: Subversion Advice-ZK and Accountable SoundnessSecurity and Cryptography for Networks | 10 September 2024
- Zero-KnowledgeEncyclopedia of Cryptography, Security and Privacy | 31 May 2024
- Noninteractive ProofEncyclopedia of Cryptography, Security and Privacy | 20 March 2024
- Efficient Non-interactive Zero-Knowledge Proof for Graph 3-Coloring ProblemFrontiers in Cyber Security | 4 January 2024
- Semi-shadow file system: An anonymous files storage solutionPeer-to-Peer Networking and Applications, Vol. 17, No. 1 | 16 October 2023
- Enhancing Privacy and Integrity in Computing Services Provisioning Using Blockchain and Zk-SNARKsIEEE Access, Vol. 12 | 1 Jan 2024
- Remote Attestation with Constrained DisclosureAnnual Computer Security Applications Conference | 4 December 2023
- Privacy-preserving Collaborative Computation: Methods, Challenges and Directions2023 International Conference on Computer and Applications (ICCA) | 28 Nov 2023
- ZKROWNN: Zero Knowledge Right of Ownership for Neural Networks2023 60th ACM/IEEE Design Automation Conference (DAC) | 9 Jul 2023
- The problem of modern cryptography axiomatic: information, computational and information-computational approachesPhysico-Mathematical Modelling and Informational Technologies, No. 36 | 1 July 2023
- Methods of Protection against Threat: Incorrect Ballot Filling by Voter in the Remote Electronic Voting SystemProceedings of Telecommunication Universities, Vol. 9, No. 2 | 30 May 2023
- Self sovereign and blockchain based access control: Supporting attributes privacy with zero knowledgeJournal of Network and Computer Applications, Vol. 212 | 1 Mar 2023
- Witness-Succinct Universally-Composable SNARKsAdvances in Cryptology – EUROCRYPT 2023 | 15 April 2023
- Cryptographic hardness under projections for time-bounded Kolmogorov complexityTheoretical Computer Science, Vol. 940 | 1 Jan 2023
- A Framework of Secure Computation as a Service in Decentralized Environment2022 Seventh International Conference on Fog and Mobile Edge Computing (FMEC) | 12 Dec 2022
- Building blocks of sharding blockchain systems: Concepts, approaches, and open problemsComputer Science Review, Vol. 46 | 1 Nov 2022
- Robustness Analysis of Zero Knowledge Proofs using Diffie Hellman Problem2022 2nd International Conference on Technological Advancements in Computational Sciences (ICTACS) | 10 Oct 2022
- Improvements on Non-Interactive Zero-Knowledge Proof Systems Related to Quadratic Residuosity LanguagesInformation Sciences, Vol. 613 | 1 Oct 2022
- Post‐Quantum Confidential Transaction ProtocolsQuantum Blockchain | 2 August 2022
- An RFID Zero-Knowledge Authentication Protocol Based on Quadratic ResiduesIEEE Internet of Things Journal, Vol. 9, No. 14 | 15 Jul 2022
- Attribute-based signatures from lattices: unbounded attributes and semi-adaptive securityDesigns, Codes and Cryptography, Vol. 90, No. 5 | 2 April 2022
- Using Zero-Knowledge Proof for Secure Data Transmission on Distributed NetworkInternational Journal of Scientific Research in Science and Technology | 10 March 2022
- An Efficient Privacy-Preserving Credit Score System Based on Noninteractive Zero-Knowledge ProofIEEE Systems Journal, Vol. 16, No. 1 | 1 Mar 2022
- A Survey on Group Signatures and Ring Signatures: Traceability vs. AnonymityCryptography, Vol. 6, No. 1 | 19 January 2022
- Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard ModelPublic-Key Cryptography – PKC 2022 | 27 February 2022
- A Gentle Introduction to Zero-KnowledgeICT Innovations 2021. Digital Transformation | 12 April 2022
- Resumable Zero-Knowledge for Circuits from Symmetric Key PrimitivesInformation Security and Privacy | 29 November 2022
- Universally Composable $$\varSigma $$-protocols in the Global Random-Oracle ModelTheory of Cryptography | 21 December 2022
- Triply Adaptive UC NIZKAdvances in Cryptology – ASIACRYPT 2022 | 30 January 2023
- Overview of Zero-Knowledge Proof and Its Applications in BlockchainBlockchain Technology and Application | 16 December 2022
- Cryptographic and Financial FairnessIEEE Transactions on Information Forensics and Security, Vol. 17 | 1 Jan 2022
- A Regulatable Data Privacy Protection Scheme for Energy Transactions Based on Consortium BlockchainSecurity and Communication Networks, Vol. 2021 | 7 Dec 2021
- Asymmetric cryptographic protocols with a blockchain core: development problems and their solutionsPhysico-mathematical modelling and informational technologies, No. 32 | 8 July 2021
- Cryptographic Framework for Role Control Remedy: A Secure Role Engineering mechanism for Single Authority OrganizationsFuture Generation Computer Systems, Vol. 117 | 1 Apr 2021
- Revisiting NIZK-Based Technique for Chosen-Ciphertext Security: Security Analysis and Corrected ProofsApplied Sciences, Vol. 11, No. 8 | 8 April 2021
- Single-to-Multi-theorem Transformations for Non-interactive Statistical Zero-KnowledgePublic-Key Cryptography – PKC 2021 | 1 May 2021
- Key-Oblivious Encryption from Isogenies with Application to Accountable Tracing SignaturesProgress in Cryptology – INDOCRYPT 2021 | 9 December 2021
- Toward Non-interactive Zero-Knowledge Proofs for NP from LWEJournal of Cryptology, Vol. 34, No. 1 | 6 January 2021
- Privacy-Preserving Public Key Infrastructure for Vehicular Networks2020 IEEE 45th Conference on Local Computer Networks (LCN) | 16 Nov 2020
- Multi-theorem Preprocessing NIZKs from LatticesJournal of Cryptology, Vol. 33, No. 3 | 26 April 2019
- Verifiable Random Functions from Non-interactive Witness-Indistinguishable ProofsJournal of Cryptology, Vol. 33, No. 2 | 4 September 2019
- An Introduction to the Use of zk-SNARKs in BlockchainsMathematical Research for Blockchain Economy | 14 February 2020
- Non-interactive Zero-Knowledge Arguments for QMA, with PreprocessingAdvances in Cryptology – CRYPTO 2020 | 10 August 2020
- LOKI Vote: A Blockchain-Based Coercion Resistant E-Voting ProtocolInformation Systems | 21 November 2020
- Perfect Zero Knowledge: New Upperbounds and Relativized SeparationsTheory of Cryptography | 9 December 2020
- Batch Verification for Statistical Zero Knowledge ProofsTheory of Cryptography | 9 December 2020
- Dual-Mode NIZKs: Possibility and Impossibility Results for Property TransferProgress in Cryptology – INDOCRYPT 2020 | 8 December 2020
- On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodingscomputational complexity, Vol. 28, No. 4 | 20 August 2018
- Non-interactive zero knowledge proofs for the authentication of IoT devices in reduced connectivity environmentsAd Hoc Networks, Vol. 95 | 1 Dec 2019
- FabZK: Supporting Privacy-Preserving, Auditable Smart Contracts in Hyperledger Fabric2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) | 1 Jun 2019
- Cryptographic primitives in blockchainsJournal of Network and Computer Applications, Vol. 127 | 1 Feb 2019
- Towards Non-Interactive Zero-Knowledge for NP from LWEPublic-Key Cryptography – PKC 2019 | 6 April 2019
- Noninteractive Zero Knowledge for NP from (Plain) Learning with ErrorsAdvances in Cryptology – CRYPTO 2019 | 1 August 2019
- Fully Homomorphic NIZK and NIWI ProofsTheory of Cryptography | 22 November 2019
- Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum SignaturesProceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security | 15 October 2018
- Certifying Trapdoor Permutations, RevisitedTheory of Cryptography | 4 November 2018
- Subversion-Zero-Knowledge SNARKsPublic-Key Cryptography – PKC 2018 | 1 March 2018
- New (and Old) Proof Systems for Lattice ProblemsPublic-Key Cryptography – PKC 2018 | 1 March 2018
- Multi-Theorem Preprocessing NIZKs from LatticesAdvances in Cryptology – CRYPTO 2018 | 24 July 2018
- Fully Dynamic Group Signature Scheme with Member Registration and Verifier-Local RevocationMathematics and Computing | 29 September 2018
- Электронное Голосование: Понятие и Особенности (E-Voting: The Concept and Features)SSRN Electronic Journal, Vol. 20 | 1 Jan 2018
- Конституционность Электронного Голосования (The Constitutionality of Electronic Voting)SSRN Electronic Journal, Vol. 87 | 1 Jan 2018
- Scalable Zero Knowledge Via Cycles of Elliptic CurvesAlgorithmica, Vol. 79, No. 4 | 4 October 2016
- Computationally-Sound ProofsLogic Colloquium '95 | 2 Mar 2017
- Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKsAdvances in Cryptology – CRYPTO 2017 | 29 July 2017
- Efficient Rational Proofs for Space Bounded ComputationsDecision and Game Theory for Security | 4 October 2017
- On the Impossibility of Entropy Reversal, and Its Application to Zero-Knowledge ProofsTheory of Cryptography | 5 November 2017
- Verifiable Random Functions from Non-interactive Witness-Indistinguishable ProofsTheory of Cryptography | 5 November 2017
- Cinderella: Turning Shabby X.509 Certificates into Elegant Anonymous Credentials with the Magic of Verifiable Computation2016 IEEE Symposium on Security and Privacy (SP) | 1 May 2016
- Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient CircuitsTheory of Cryptography | 24 December 2015
- A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random OraclesTheory of Cryptography | 24 December 2015
- On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized EncodingsAdvances in Cryptology – CRYPTO 2016 | 21 July 2016
- NIZKs with an Untrusted CRS: Security in the Face of Parameter SubversionAdvances in Cryptology – ASIACRYPT 2016 | 9 November 2016
- ReferencesApplied Cryptography, Second Edition | 9 October 2015
- Spreading Alerts Quietly and the Subgroup Escape ProblemJournal of Cryptology, Vol. 28, No. 4 | 24 October 2014
- How to Achieve Perfect Simulation and a Complete Problem for Non-interactive Perfect Zero-KnowledgeJournal of Cryptology, Vol. 28, No. 3 | 21 November 2013
- Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs2015 IEEE Symposium on Security and Privacy | 1 May 2015
- Computing on Authenticated DataJournal of Cryptology, Vol. 28, No. 2 | 18 April 2014
- Obfuscation-Based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NPTheory of Cryptography | 1 Jan 2015
- Cluster Computing in Zero KnowledgeAdvances in Cryptology - EUROCRYPT 2015 | 14 April 2015
- Impossibility of Black-Box Simulation Against Leakage AttacksAdvances in Cryptology -- CRYPTO 2015 | 1 August 2015
- Cryptography in the Multi-string ModelJournal of Cryptology, Vol. 27, No. 3 | 29 May 2013
- Malleable Signatures: New Definitions and Delegatable Anonymous Credentials2014 IEEE 27th Computer Security Foundations Symposium | 1 Jul 2014
- RSA EncryptionA Mathematical Odyssey | 3 March 2014
- Non-Malleable Zero Knowledge: Black-Box Constructions and Definitional RelationshipsSecurity and Cryptography for Networks | 1 Jan 2014
- Remote End-to-End Voting SchemeHomomorphic Encryption and Applications | 11 October 2014
- Scalable Zero Knowledge via Cycles of Elliptic CurvesAdvances in Cryptology – CRYPTO 2014 | 1 Jan 2014
- A Survey of Noninteractive Zero Knowledge Proof System and Its ApplicationsThe Scientific World Journal, Vol. 2014 | 1 Jan 2014
- Round-Optimal Password-Based Authenticated Key ExchangeJournal of Cryptology, Vol. 26, No. 4 | 4 December 2012
- Enhancements of Trapdoor PermutationsJournal of Cryptology, Vol. 26, No. 3 | 13 September 2012
- Pinocchio: Nearly Practical Verifiable Computation2013 IEEE Symposium on Security and Privacy | 1 May 2013
- Mercurial Commitments with Applications to Zero-Knowledge SetsJournal of Cryptology, Vol. 26, No. 2 | 28 March 2012
- Improving of Non-Interactive Zero-Knowledge Arguments Using Oblivious TransferNew Results in Dependability and Computer Systems | 1 Jan 2013
- Cryptography Using Captcha PuzzlesPublic-Key Cryptography – PKC 2013 | 1 Jan 2013
- Communication Locality in Secure Multi-party ComputationTheory of Cryptography | 1 Jan 2013
- Concurrent Zero Knowledge in the Bounded Player ModelTheory of Cryptography | 1 Jan 2013
- Succinct Malleable NIZKs and an Application to Compact ShufflesTheory of Cryptography | 1 Jan 2013
- Quadratic Span Programs and Succinct NIZKs without PCPsAdvances in Cryptology – EUROCRYPT 2013 | 1 Jan 2013
- Practical Internet voting systemJournal of Network and Computer Applications, Vol. 36, No. 1 | 1 Jan 2013
- Learning secrets interactively. Dynamic modeling in inductive inferenceInformation and Computation, Vol. 220-221 | 1 Nov 2012
- New Techniques for Noninteractive Zero-KnowledgeJournal of the ACM, Vol. 59, No. 3 | 1 June 2012
- Multiparty computation secure against continual memory leakageProceedings of the forty-fourth annual ACM symposium on Theory of computing | 19 May 2012
- Targeted malleabilityProceedings of the 3rd Innovations in Theoretical Computer Science Conference | 8 January 2012
- Public-Key Cryptosystems Resilient to Key LeakageSIAM Journal on Computing, Vol. 41, No. 4 | 16 August 2012
- Malleable Proof Systems and ApplicationsAdvances in Cryptology – EUROCRYPT 2012 | 1 Jan 2012
- On the Security of Dynamic Group Signatures: Preventing Signature HijackingPublic Key Cryptography – PKC 2012 | 1 Jan 2012
- On the Non-malleability of the Fiat-Shamir TransformProgress in Cryptology - INDOCRYPT 2012 | 1 Jan 2012
- Multi-Undeniable Signature Schemes2011 Seventh International Conference on Computational Intelligence and Security | 1 Dec 2011
- Zero-Knowledge Sets With Short ProofsIEEE Transactions on Information Theory, Vol. 57, No. 4 | 1 Apr 2011
- Lossy Trapdoor Functions and Their ApplicationsSIAM Journal on Computing, Vol. 40, No. 6 | 22 December 2011
- Zero-KnowledgeEncyclopedia of Cryptography and Security | 1 Jan 2011
- Noninteractive ProofEncyclopedia of Cryptography and Security | 1 Jan 2011
- Practical Remote End-to-End Voting SchemeElectronic Government and the Information Systems Perspective | 1 Jan 2011
- On server trust in private proxy auctionsElectronic Commerce Research, Vol. 10, No. 3-4 | 9 October 2010
- Cryptography against Continuous Memory Attacks2010 IEEE 51st Annual Symposium on Foundations of Computer Science | 1 Oct 2010
- Coercion-Resistant Electronic ElectionsTowards Trustworthy Elections | 1 Jan 2010
- Constructing Verifiable Random Functions with Large Input SpacesAdvances in Cryptology – EUROCRYPT 2010 | 1 Jan 2010
- On Invertible Sampling and Adaptive SecurityAdvances in Cryptology - ASIACRYPT 2010 | 1 Jan 2010
- Cryptology in the Classroom: Analyzing a Zero-Knowledge ProtocolCryptologia, Vol. 33, No. 1 | 27 Jan 2009
- Anonymous Consecutive Delegation of Signing Rights: Unifying Group and Proxy SignaturesFormal to Practical Security | 1 Jan 2009
- Randomizable Proofs and Delegatable Anonymous CredentialsAdvances in Cryptology - CRYPTO 2009 | 1 Jan 2009
- Definition and Construction of Multi-prover Zero-Knowledge Argument2009 WRI International Conference on Communications and Mobile Computing | 1 Jan 2009
- On Monotone Formula Composition of Perfect Zero-Knowledge LanguagesSIAM Journal on Computing, Vol. 38, No. 4 | 23 July 2008
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space EfficiencyTheory of Cryptography | 1 Jan 2008
- P-signatures and Noninteractive Anonymous CredentialsTheory of Cryptography | 1 Jan 2008
- Interactive and Noninteractive Zero Knowledge are Equivalent in the Help ModelTheory of Cryptography | 1 Jan 2008
- How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-KnowledgeTheory of Cryptography | 1 Jan 2008
- Zero-Knowledge Sets with Short ProofsAdvances in Cryptology – EUROCRYPT 2008 | 1 Jan 2008
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice ProblemsAdvances in Cryptology – CRYPTO 2008 | 1 Jan 2008
- Anonymous Proxy SignaturesSecurity and Cryptography for Networks | 1 Jan 2008
- Dynamic Modeling in Inductive InferenceAlgorithmic Learning Theory | 1 Jan 2008
- 3-Message NP Arguments in the BPK Model with Optimal Soundness and Zero-KnowledgeAlgorithms and Computation | 1 Jan 2008
- Certificateless threshold cryptosystem secure against chosen-ciphertext attackInformation Sciences, Vol. 177, No. 24 | 1 Dec 2007
- Cryptography from Sunspots: How to Use an Imperfect Reference String48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) | 1 Oct 2007
- ID-based threshold decryption secure against adaptive chosen-ciphertext attackComputers & Electrical Engineering, Vol. 33, No. 3 | 1 May 2007
- Hybrid commitments and their applications to zero-knowledge proof systemsTheoretical Computer Science, Vol. 374, No. 1-3 | 1 Apr 2007
- Derandomization in CryptographySIAM Journal on Computing, Vol. 37, No. 2 | 16 May 2007
- Zaps and Their ApplicationsSIAM Journal on Computing, Vol. 36, No. 6 | 9 February 2007
- Conjunctive, Subset, and Range Queries on Encrypted DataTheory of Cryptography | 1 Jan 2007
- Evaluating Branching Programs on Encrypted DataTheory of Cryptography | 1 Jan 2007
- Perfect NIZK with Adaptive SoundnessTheory of Cryptography | 1 Jan 2007
- Conditional Computational Entropy, or Toward Separating Pseudoentropy from CompressibilityAdvances in Cryptology - EUROCRYPT 2007 | 1 Jan 2007
- A Subliminal-Free Variant of ECDSAInformation Hiding | 1 Jan 2007
- Simulatable VRFs with Applications to Multi-theorem NIZKAdvances in Cryptology - CRYPTO 2007 | 1 Jan 2007
- Cryptography in the Multi-string ModelAdvances in Cryptology - CRYPTO 2007 | 1 Jan 2007
- A Survey on Mix Networks and Their Secure ApplicationsProceedings of the IEEE, Vol. 94, No. 12 | 1 Dec 2006
- Local zero knowledgeProceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 21 May 2006
- A framework and taxonomy for comparison of electronic voting schemesComputers & Security, Vol. 25, No. 2 | 1 Mar 2006
- Concurrent Zero Knowledge Without Complexity AssumptionsTheory of Cryptography | 1 Jan 2006
- Mercurial Commitments: Minimal Assumptions and Efficient ConstructionsTheory of Cryptography | 1 Jan 2006
- Perfect Non-interactive Zero Knowledge for NPAdvances in Cryptology - EUROCRYPT 2006 | 1 Jan 2006
- Efficient Zero Knowledge on the InternetAutomata, Languages and Programming | 1 Jan 2006
- On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String ModelMathematical Foundations of Computer Science 2006 | 1 Jan 2006
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group SignaturesAdvances in Cryptology – ASIACRYPT 2006 | 1 Jan 2006
- Selectively Traceable AnonymityPrivacy Enhancing Technologies | 1 Jan 2006
- Parallel Repetition of Zero-Knowledge Proofs and the Possibility of Basing Cryptography on NP-Hardness21st Annual IEEE Conference on Computational Complexity (CCC'06) | 1 Jan 2006
- Input-Indistinguishable Computation2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) | 1 Jan 2006
- Coercion-resistant electronic electionsProceedings of the 2005 ACM workshop on Privacy in the electronic society | 7 November 2005
- Collusion-free protocolsProceedings of the thirty-seventh annual ACM symposium on Theory of computing | 22 May 2005
- A Digital Cash Protocol Based on Additive Zero KnowledgeComputational Science and Its Applications – ICCSA 2005 | 1 Jan 2005
- Mercurial Commitments with Applications to Zero-Knowledge SetsAdvances in Cryptology – EUROCRYPT 2005 | 1 Jan 2005
- Reducing Complexity Assumptions for Statistically-Hiding CommitmentAdvances in Cryptology – EUROCRYPT 2005 | 1 Jan 2005
- Single-Prover Concurrent Zero Knowledge in Almost Constant RoundsAutomata, Languages and Programming | 1 Jan 2005
- Concurrent Zero Knowledge in the Public-Key ModelAutomata, Languages and Programming | 1 Jan 2005
- Unconditional Characterizations of Non-interactive Zero-KnowledgeAdvances in Cryptology – CRYPTO 2005 | 1 Jan 2005
- Impossibility and Feasibility Results for Zero Knowledge with Public KeysAdvances in Cryptology – CRYPTO 2005 | 1 Jan 2005
- An Unbounded Simulation-Sound Non-interactive Zero-Knowledge Proof System for NPInformation Security and Cryptology | 1 Jan 2005
- Foundations of Modern CryptographyContemporary Cryptology | 1 Jan 2005
- Foundations of Group Signatures: The Case of Dynamic GroupsTopics in Cryptology – CT-RSA 2005 | 1 Jan 2005
- Fair-Zero KnowledgeTheory of Cryptography | 1 Jan 2005
- Authenticating Mobile Agent Platforms Using Signature Chaining Without Trusted Third Parties2005 IEEE International Conference on e-Technology, e-Commerce and e-Service | 1 Jan 2005
- A novel method for authenticating mobile agents with one-way signature chainingProceedings Autonomous Decentralized Systems, 2005. ISADS 2005. | 1 Jan 2005
- Concurrent zero-knowledgeJournal of the ACM, Vol. 51, No. 6 | 1 November 2004
- Two-party generation of DSA signaturesInternational Journal of Information Security, Vol. 2, No. 3-4 | 1 August 2004
- Completely fair SFE and coalition-safe cheap talkProceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 25 July 2004
- Private Keyword-Based Push and Pull with Applications to Anonymous CommunicationApplied Cryptography and Network Security | 1 Jan 2004
- Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key ModelAdvances in Cryptology – CRYPTO 2004 | 1 Jan 2004
- On NC1 Boolean Circuit Composition of Non-interactive Perfect Zero-KnowledgeMathematical Foundations of Computer Science 2004 | 1 Jan 2004
- Reducing Server Trust in Private Proxy AuctionsTrust and Privacy in Digital Business | 1 Jan 2004
- Improved Setup Assumptions for 3-Round Resettable Zero KnowledgeAdvances in Cryptology - ASIACRYPT 2004 | 1 Jan 2004
- Automatic generation of two-party computationsProceedings of the 10th ACM conference on Computer and communications security | 27 October 2003
- Secure Password System against ImposterThe KIPS Transactions:PartC, Vol. 10C, No. 2 | 1 Apr 2003
- Nonmalleable CryptographySIAM Review, Vol. 45, No. 4 | 4 August 2006
- Reduction Zero-KnowledgeSecurity in Communication Networks | 14 March 2003
- Equivocable and Extractable Commitment SchemesSecurity in Communication Networks | 14 March 2003
- Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General AssumptionsAdvances in Cryptology — EUROCRYPT 2003 | 13 May 2003
- Resettable Zero-Knowledge in the Weak Public-Key ModelAdvances in Cryptology — EUROCRYPT 2003 | 13 May 2003
- Non-interactive Quantum Perfect and Statistical Zero-KnowledgeAlgorithms and Computation | 1 Jan 2003
- Derandomization in CryptographyAdvances in Cryptology - CRYPTO 2003 | 1 Jan 2003
- Plaintext Awareness via Key RegistrationAdvances in Cryptology - CRYPTO 2003 | 1 Jan 2003
- Zero-knowledge sets44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. | 1 Jan 2003
- Universally composable two-party and multi-party secure computationProceedings of the thiry-fourth annual ACM symposium on Theory of computing | 19 May 2002
- Design and Security Analysis of Anonymous Group Identification ProtocolsPublic Key Cryptography | 5 February 2002
- Unique Signatures and Verifiable Random Functions from the DH-DDH SeparationAdvances in Cryptology — CRYPTO 2002 | 13 September 2002
- Randomness-Optimal Characterization of Two NP Proof SystemsRandomization and Approximation Techniques in Computer Science | 23 August 2002
- Amortized E-CashFinancial Cryptography | 31 July 2002
- The round complexity of verifiable secret sharing and secure multicastProceedings of the thirty-third annual ACM symposium on Theory of computing | 6 July 2001
- Soundness in the Public-Key ModelAdvances in Cryptology — CRYPTO 2001 | 2 August 2001
- Robust Non-interactive Zero KnowledgeAdvances in Cryptology — CRYPTO 2001 | 2 August 2001
- Two-Party Generation of DSA SignaturesAdvances in Cryptology — CRYPTO 2001 | 2 August 2001
- Min-round Resettable Zero-Knowledge in the Public-Key ModelAdvances in Cryptology — EUROCRYPT 2001 | 15 April 2001
- Efficient and Non-interactive Non-malleable CommitmentAdvances in Cryptology — EUROCRYPT 2001 | 15 April 2001
- Mutually Independent CommitmentsAdvances in Cryptology — ASIACRYPT 2001 | 20 November 2001
- A protocol to achieve independence in constant roundsIEEE Transactions on Parallel and Distributed Systems, Vol. 11, No. 7 | 1 Jul 2000
- Computationally Sound ProofsSIAM Journal on Computing, Vol. 30, No. 4 | 27 July 2006
- Nonmalleable CryptographySIAM Journal on Computing, Vol. 30, No. 2 | 27 July 2006
- Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof SystemsAdvances in Cryptology — ASIACRYPT 2000 | 27 October 2000
- Necessary and Sufficient Assumptions for Non-interactive Zero-Knowledge Proofs of Knowledge for All NP RelationsAutomata, Languages and Programming | 18 February 2002
- Efficient Concurrent Zero-Knowledge in the Auxiliary String ModelAdvances in Cryptology — EUROCRYPT 2000 | 12 May 2000
- Short Proofs of Knowledge for FactoringPublic Key Cryptography | 1 Jan 2000
- Zaps and their applicationsProceedings 41st Annual Symposium on Foundations of Computer Science | 1 Jan 2000
- Multiple NonInteractive Zero Knowledge Proofs Under General AssumptionsSIAM Journal on Computing, Vol. 29, No. 1 | 27 July 2006
- Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZKAdvances in Cryptology — CRYPTO’ 99 | 16 December 1999
- Non-interactive Zero-Knowledge: A Low-Randomness Characterization of NP (Extended Abstract)Automata, Languages and Programming | 18 January 2002
- Computationally Private Information Retrieval with Polylogarithmic CommunicationAdvances in Cryptology — EUROCRYPT ’99 | 15 April 1999
- Conditional Oblivious Transfer and Timed-Release EncryptionAdvances in Cryptology — EUROCRYPT ’99 | 15 April 1999
- Commitment Schemes and Zero-Knowledge ProtocolsLectures on Data Security | 29 March 2003
- Batching proofs of knowledge and its applicationsProceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99 | 1 Jan 1999
- Verifiable random functions40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) | 1 Jan 1999
- Non-interactive cryptocomputing for NC/sup 1/40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) | 1 Jan 1999
- An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime productsProceedings of the 5th ACM conference on Computer and communications security | 1 November 1998
- Communication-efficient anonymous group identificationProceedings of the 5th ACM conference on Computer and communications security | 1 November 1998
- Computationally-Sound ProofsLogic Colloquium ’95 | 1 Jan 1998
- Securing threshold cryptosystems against chosen ciphertext attackAdvances in Cryptology — EUROCRYPT'98 | 25 May 2006
- Image density is complete for non-interactive-SZKAutomata, Languages and Programming | 26 May 2006
- Concurrent zero-knowledge: Reducing the need for timing constraintsAdvances in Cryptology — CRYPTO '98 | 28 May 2006
- 1995 European Summer Meeting of the Association for Symbolic LogicBulletin of Symbolic Logic, Vol. 3, No. 1 | 15 January 2014
- Randomness-efficient non-interactive zero knowledgeAutomata, Languages and Programming | 8 June 2005
- Round-Optimal Zero-Knowledge Arguments Based on Any One-Way FunctionAdvances in Cryptology — EUROCRYPT ’97 | 13 July 2001
- Rapid Demonstration of Linear Relations Connected by Boolean OperatorsAdvances in Cryptology — EUROCRYPT ’97 | 13 July 2001
- A Taxonomy of Proof SystemsComplexity Theory Retrospective II | 1 Jan 1997
- On the foundations of modern cryptographyAdvances in Cryptology — CRYPTO '97 | 17 May 2006
- Towards realizing random oracles: Hash functions that hide all partial informationAdvances in Cryptology — CRYPTO '97 | 17 May 2006
- New directions in cryptography: twenty some years later (or cryptograpy and complexity theory: a match made in heaven)Proceedings 38th Annual Symposium on Foundations of Computer Science | 1 Jan 1997
- Replication is not needed: single database, computationally-private information retrievalProceedings 38th Annual Symposium on Foundations of Computer Science | 1 Jan 1997
- The power of preprocessing in zero-knowledge proofs of knowledgeJournal of Cryptology, Vol. 9, No. 3 | 1 Jun 1996
- Certifying Permutations: Noninteractive zero-knowledge based on any trapdoor permutationJournal of Cryptology, Vol. 9, No. 3 | 1 Jun 1996
- Short Discreet ProofsAdvances in Cryptology — EUROCRYPT ’96 | 13 July 2001
- A Simple Method for Generating and Sharing Pseudo-Random Functions, with Applications to Clipper-like Key Escrow SystemsAdvances in Cryptology — CRYPT0’ 95 | 13 July 2001
- Recycling Random Bits in Composed Perfect Zero-KnowledgeAdvances in Cryptology — EUROCRYPT ’95 | 13 July 2001
- Zero-knowledge proofs of computational power in the shared string modelAdvances in Cryptology — ASIACRYPT'94 | 8 September 2005
- Methodology for digital money based on general cryptographic toolsAdvances in Cryptology — EUROCRYPT'94 | 23 May 2006
- BibliographyAgents Unleashed | 1 Jan 1995
- The knowledge complexity of quadratic residuosity languagesTheoretical Computer Science, Vol. 132, No. 1-2 | 1 Sep 1994
- Round-optimal perfect zero-knowledge proofsInformation Processing Letters, Vol. 50, No. 2 | 1 Apr 1994
- On randomization in sequential and distributed algorithmsACM Computing Surveys, Vol. 26, No. 1 | 1 March 1994
- Secret Sharing and Perfect Zero KnowledgeAdvances in Cryptology — CRYPTO’ 93 | 13 July 2001
- One Message Proof Systems with Known Space VerifiersAdvances in Cryptology — CRYPTO’ 93 | 1 Jan 1994
- Interactive Hashing can Simplify Zero-Knowledge Protocol Design Without Computational AssumptionsAdvances in Cryptology — CRYPTO’ 93 | 1 Jan 1994
- A non-interactive electronic cash systemAlgorithms and Complexity | 26 May 2005
- On monotone formula closure of SZKProceedings 35th Annual Symposium on Foundations of Computer Science | 1 Jan 1994
- CS proofsProceedings 35th Annual Symposium on Foundations of Computer Science | 1 Jan 1994
- Non-Interactive Circuit Based Proofs and Non-Interactive Perfect Zero-knowledge with PreprocessingAdvances in Cryptology — EUROCRYPT’ 92 | 1 Jan 1993
- Certifying Cryptographic Tools: The Case of Trapdoor PermutationsAdvances in Cryptology — CRYPTO’ 92 | 1 Jan 1993
- Secure and efficient off-line digital money (extended abstract)Automata, Languages and Programming | 28 May 2005
- One-message statistical Zero-Knowledge Proofs and space-bounded verifierAutomata, Languages and Programming | 2 June 2005
- Zero-knowledge proofs of knowledge without interactionProceedings., 33rd Annual Symposium on Foundations of Computer Science | 1 Jan 1992
- Broadcast Interactive ProofsAdvances in Cryptology — EUROCRYPT ’91 | 1 Jan 1991
View Options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].