Jump to content

Non-interactive zero-knowledge proof: Difference between revisions

Add links
From Wikipedia, the free encyclopedia
Browse history interactively
← Previous editNext edit →
Content deleted Content added
VisualWikitext
Added details
Tags: Mobile edit Mobile web edit
No edit summary
Tags: Visual edit Mobile edit Mobile web edit
Line 25: Line 25:


In 2019, HALO recursive zk-SNARKs without a trusted setup were presented.<ref name=":1" /> Pickles<ref>{{Cite web |title=Meet Pickles SNARK: Enabling Smart Contracts on Coda Protocol |url=https://minaprotocol.com/blog/meet-pickles-snark-enabling-smart-contracts-on-coda-protocol |access-date=2023-02-25 |website=Mina Protocol}}</ref> zk-SNARKs, based on the former construction, power MINA, the lightest blockchain.<ref>{{Cite web |last=Bonneau |first=Joseph |last2=Meckler |first2=Izaak |last3=Rao |first3=V. |last4=Evan |last5=Shapiro |date=2021 |title=Mina : Decentralized Cryptocurrency at Scale |url=https://www.semanticscholar.org/paper/Mina-%3A-Decentralized-Cryptocurrency-at-Scale-Bonneau-Meckler/e92236a6ac7882c745e7293f52b4646f52bf2a04 |access-date=2023-02-25 |website=www.semanticscholar.org |language=en}}</ref>
In 2019, HALO recursive zk-SNARKs without a trusted setup were presented.<ref name=":1" /> Pickles<ref>{{Cite web |title=Meet Pickles SNARK: Enabling Smart Contracts on Coda Protocol |url=https://minaprotocol.com/blog/meet-pickles-snark-enabling-smart-contracts-on-coda-protocol |access-date=2023-02-25 |website=Mina Protocol}}</ref> zk-SNARKs, based on the former construction, power MINA, the lightest blockchain.<ref>{{Cite web |last=Bonneau |first=Joseph |last2=Meckler |first2=Izaak |last3=Rao |first3=V. |last4=Evan |last5=Shapiro |date=2021 |title=Mina : Decentralized Cryptocurrency at Scale |url=https://www.semanticscholar.org/paper/Mina-%3A-Decentralized-Cryptocurrency-at-Scale-Bonneau-Meckler/e92236a6ac7882c745e7293f52b4646f52bf2a04 |access-date=2023-02-25 |website=www.semanticscholar.org |language=en}}</ref>

(The following paragraph and the list have been copied from [[Zero-knowledge proof|zero-knowledge proofs]])


A list of zero-knowledge proof protocols and libraries is provided below along with comparisons based on '''transparency''', '''universality''', '''plausible post-quantum security''', and '''[[programming paradigm]]'''.<ref>{{Cite journal |last=Mouris |first=Dimitris |last2=Tsoutsos |first2=Nektarios Georgios |date=2021 |title=Zilch: A Framework for Deploying Transparent Zero-Knowledge Proofs |url=https://ieeexplore.ieee.org/document/9410618 |journal=IEEE Transactions on Information Forensics and Security |volume=16 |pages=3269–3284 |doi=10.1109/TIFS.2021.3074869 |issn=1556-6021}}</ref> A transparent protocol is one that does not require any trusted setup and uses public randomness. A universal protocol is one that does not require a separate trusted setup for each circuit. Finally, a plausibly post-quantum protocol is one that is not susceptible to known attacks involving quantum algorithms.
A list of zero-knowledge proof protocols and libraries is provided below along with comparisons based on '''transparency''', '''universality''', '''plausible post-quantum security''', and '''[[programming paradigm]]'''.<ref>{{Cite journal |last=Mouris |first=Dimitris |last2=Tsoutsos |first2=Nektarios Georgios |date=2021 |title=Zilch: A Framework for Deploying Transparent Zero-Knowledge Proofs |url=https://ieeexplore.ieee.org/document/9410618 |journal=IEEE Transactions on Information Forensics and Security |volume=16 |pages=3269–3284 |doi=10.1109/TIFS.2021.3074869 |issn=1556-6021}}</ref> A transparent protocol is one that does not require any trusted setup and uses public randomness. A universal protocol is one that does not require a separate trusted setup for each circuit. Finally, a plausibly post-quantum protocol is one that is not susceptible to known attacks involving quantum algorithms.

Revision as of 10:07, 25 February 2023

Non-interactive zero-knowledge proofs are cryptographic primitives, where information between a prover and a verifier can be authenticated by the prover, without revealing any of the specific information beyond the validity of the statement itself. This function of encryption makes direct communication between the prover and verifier unnecessary, effectively removing any intermediaries. The core trustless cryptography "proofing" involves a hash function generation of a random number, constrained within mathematical parameters (primarily to modulate hashing difficulties) determined by the prover and verifier.[1]

The key advantage of non-interactive zero-knowledge proofs is that they can be used in situations where there is no possibility of interaction between the prover and verifier, such as in online transactions where the two parties are not able to communicate in real time. This makes non-interactive zero-knowledge proofs particularly useful in decentralized systems like blockchains, where transactions are verified by a network of nodes and there is no central authority to oversee the verification process.[2]

Most non-interactive zero-knowledge proofs are based on mathematical constructs like elliptic curve cryptography or pairing-based cryptography, which allow for the creation of short and easily verifiable proofs of the truth of a statement. Unlike interactive zero-knowledge proofs, which require multiple rounds of interaction between the prover and verifier, non-interactive zero-knowledge proofs are designed to be efficient and can be used to verify a large number of statements simultaneously.[2]

History

Blum, Feldman, and Micali[3] showed in 1988 that a common reference string shared between the prover and the verifier is sufficient to achieve computational zero-knowledge without requiring interaction. Goldreich and Oren[4] gave impossibility results[clarification needed] for one shot zero-knowledge protocols in the standard model. In 2003, Shafi Goldwasser and Yael Tauman Kalai published an instance of an identification scheme for which any hash function will yield an insecure digital signature scheme.[5] These results are not contradictory, as the impossibility result[clarification needed] of Goldreich and Oren does not hold in the common reference string model or the random oracle model. Non-interactive zero-knowledge proofs however show a separation between the cryptographic tasks that can be achieved in the standard model and those that can be achieved in 'more powerful' extended models.[citation needed]

The model influences the properties that can be obtained from a zero-knowledge protocol. Pass[6] showed that in the common reference string model non-interactive zero-knowledge protocols do not preserve all of the properties of interactive zero-knowledge protocols; e.g., they do not preserve deniability. Non-interactive zero-knowledge proofs can also be obtained in the random oracle model using the Fiat–Shamir heuristic.

Blockchain Applications

In 2012, Alessandro Chiesa et al developed the zk-SNARK protocol, an acronym for zero-knowledge succinct non-interactive argument of knowledge.[7] The first widespread application of zk-SNARKs was in the Zerocash blockchain protocol, where zero-knowledge cryptography provides the computational backbone, by facilitating mathematical proofs that one party has possession of certain information without revealing what that information is.[8] Zcash utilized zk-SNARKs to facilitate four distinct transaction types: private, shielding, deshielding, and public. This protocol allowed users to determine how much data was shared with the public ledger for each transaction.[9] Ethereum zk-Rollups also utilize zk-SNARKs to increase scalability.[10]

In 2017, Bulletproofs[11] was released, which enable proving that a committed value is in a range using a logarithmic (in the bit length of the range) number of field and group elements.[12] Bulletproofs was later implemented into Mimblewimble protocol (the basis for Grin and Beam, and Litecoin via extension blocks) and Monero cryptocurrency.[13]

In 2018, the zk-STARK (zero-knowledge Scalable Transparent Argument of Knowledge)[14] protocol was introduced by Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, and Michael Riabzev,[15] offering transparency (no trusted setup), quasi-linear proving time, and poly-logarithmic verification time. Zero-Knowledge Succinct Transparent Arguments of Knowledge are a type of cryptographic proof system that enables one party (the prover) to prove to another party (the verifier) that a certain statement is true, without revealing any additional information beyond the truth of the statement itself. zk-STARKs are succinct, meaning that they allow for the creation of short proofs that are easy to verify, and they are transparent, meaning that anyone can verify the proof without needing any secret information.[15]

Unlike the first generation of zk-SNARKs, zk-STARKs, by default, do not require a trusted setup, which makes them particularly useful for decentralized applications like blockchains. Additionally, zk-STARKs can be used to verify many statements at once, making them scalable and efficient.[2]

In 2019, HALO recursive zk-SNARKs without a trusted setup were presented.[16] Pickles[17] zk-SNARKs, based on the former construction, power MINA, the lightest blockchain.[18]

(The following paragraph and the list have been copied from zero-knowledge proofs)

A list of zero-knowledge proof protocols and libraries is provided below along with comparisons based on transparency, universality, plausible post-quantum security, and programming paradigm.[19] A transparent protocol is one that does not require any trusted setup and uses public randomness. A universal protocol is one that does not require a separate trusted setup for each circuit. Finally, a plausibly post-quantum protocol is one that is not susceptible to known attacks involving quantum algorithms.

Non-interactive zero-knowledge proof systems
ZKP System Publication year Protocol Transparent Universal Plausibly Post-Quantum Secure Programming Paradigm
Pinocchio[20] 2013 zk-SNARK No No No Procedural
Geppetto[21] 2015 zk-SNARK No No No Procedural
TinyRAM[22] 2013 zk-SNARK No No No Procedural
Buffet[23] 2015 zk-SNARK No No No Procedural
ZoKrates[24] 2018 zk-SNARK No No No Procedural
xJsnark[25] 2018 zk-SNARK No No No Procedural
vRAM[26] 2018 zk-SNARG No Yes No Assembly
vnTinyRAM[27] 2014 zk-SNARK No Yes No Procedural
MIRAGE[28] 2020 zk-SNARK No Yes No Arithmetic Circuits
Sonic[29] 2019 zk-SNARK No Yes No Arithmetic Circuits
Marlin[30] 2020 zk-SNARK No Yes No Arithmetic Circuits
PLONK[31] 2019 zk-SNARK No Yes No Arithmetic Circuits
SuperSonic[32] 2020 zk-SNARK Yes Yes No Arithmetic Circuits
Bulletproofs[33] 2018 Bulletproofs Yes Yes No Arithmetic Circuits
Hyrax[34] 2018 zk-SNARK Yes Yes No Arithmetic Circuits
Halo[16] 2019 zk-SNARK Yes Yes No Arithmetic Circuits
Virgo[35] 2020 zk-SNARK Yes Yes Yes Arithmetic Circuits
Ligero[36] 2017 zk-SNARK Yes Yes Yes Arithmetic Circuits
Aurora[37] 2019 zk-SNARK Yes Yes Yes Arithmetic Circuits
zk-STARK[15][38] 2019 zk-STARK Yes Yes Yes Assembly
Zilch[39][40] 2021 zk-STARK Yes Yes Yes Object-Oriented

Definition

Originally,[3] non-interactive zero-knowledge was only defined as a single theorem-proof system. In such a system each proof requires its own fresh common reference string. A common reference string in general is not a random string. It may, for instance, consist of randomly chosen group elements that all protocol parties use. Although the group elements are random, the reference string is not as it contains a certain structure (e.g., group elements) that is distinguishable from randomness. Subsequently, Feige, Lapidot, and Shamir[41] introduced multi-theorem zero-knowledge proofs as a more versatile notion for non-interactive zero-knowledge proofs.

Pairing-based non-interactive proofs

Pairing-based cryptography has led to several cryptographic advancements. One of these advancements is more powerful and more efficient non-interactive zero-knowledge proofs. The seminal idea was to hide the values for the pairing evaluation in a commitment. Using different commitment schemes, this idea was used to build zero-knowledge proof systems under the sub-group hiding[42] and under the decisional linear assumption.[43] These proof systems prove circuit satisfiability, and thus by the Cook–Levin theorem allow proving membership for every language in NP. The size of the common reference string and the proofs is relatively small; however, transforming a statement into a boolean circuit incurs considerable overhead.

Proof systems under the sub-group hiding, decisional linear assumption, and external Diffie–Hellman assumption that allow directly proving the pairing product equations that are common in pairing-based cryptography have been proposed.[44]

Under strong knowledge assumptions, it is known how to create sublinear-length computationally soundproof systems for NP-complete languages. More precisely, the proof in such proof systems consists only of a small number of bilinear group elements.[45][46]

References

  1. ^ Goldreich, Oded; Krawczyk, Hugo (1996). "On the Composition of Zero-Knowledge Proof Systems". SAIM. 25 (1): 169–192. doi:10.1137/S0097539791220688. Retrieved 4 November 2022.
  2. ^ a b c Gong, Yinjie; Jin, Yifei; Li, Yuchan; Liu, Ziyi; Zhu, Zhiyi (January 2022). "Analysis and comparison of the main zero-knowledge proof scheme". 2022 International Conference on Big Data, Information and Computer Network (BDICN): 366–372. doi:10.1109/BDICN55575.2022.00074.
  3. ^ a b Manuel Blum, Paul Feldman, and Silvio Micali. Non-Interactive Zero-Knowledge and Its Applications. Proceedings of the twentieth annual ACM symposium on Theory of computing (STOC 1988). 103–112. 1988
  4. ^ Oded Goldreich and Yair Oren. Definitions and Properties of Zero-Knowledge Proof Systems. Journal of Cryptology. Vol 7(1). 1–32. 1994 (PS)
  5. ^ Shafi Goldwasser and Yael Kalai. On the (In)security of the Fiat–Shamir Paradigm. Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS'03). 2003
  6. ^ Rafael Pass. On Deniability in the Common Reference String and Random Oracle Model. Advances in Cryptology – CRYPTO 2003. 316–337. 2003 (PS)
  7. ^ Bitansky, Nir; Canetti, Ran; Chiesa, Alessandro; Tromer, Eran (January 2012). "From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again". Proceedings of the 3rd Innovations in Theoretical Computer Science Conference on - ITCS '12. ACM. pp. 326–349. doi:10.1145/2090236.2090263. ISBN 9781450311151. S2CID 2576177.
  8. ^ Ben-Sasson, Eli; Chiesa, Alessandro; Garman, Christina; Green, Matthew; Miers, Ian; Tromer, Eran; Virza, Madars (18 May 2014). "Zerocash: Decentralized Anonymous Payments from Bitcoin" (PDF). IEEE. Retrieved 26 January 2016.
  9. ^ Ben-Sasson, Eli; Chiesa, Alessandro. "What are zk-SNARKs?". z.cash. Retrieved 3 November 2022.
  10. ^ "Zero-Knowledge rollups". ethereum.org. Retrieved 2023-02-25.
  11. ^ Bünz, Benedikt; Bootle, Jonathan; Boneh, Dan; Poelstra, Andrew; Wuille, Pieter; Maxwell, Greg (May 2018). "Bulletproofs: Short Proofs for Confidential Transactions and More". 2018 IEEE Symposium on Security and Privacy (SP): 315–334. doi:10.1109/SP.2018.00020.
  12. ^ Bünz, Benedikt; Bootle, Jonathan; Boneh, Dan; Poelstra, Andrew; Wuille, Pieter; Maxwell, Greg (May 2018). "Bulletproofs: Short Proofs for Confidential Transactions and More" (PDF). 2018 IEEE Symposium on Security and Privacy (SP): 315–334. doi:10.1109/SP.2018.00020. ISBN 978-1-5386-4353-2. S2CID 3337741. Retrieved 2 December 2022.
  13. ^ Odendaal, Hansie; Sharrock, Cayle; Heerden, SW. "Bulletproofs and Mimblewimble". Tari Labs University. Archived from the original on 29 September 2020. Retrieved 3 December 2020.
  14. ^ http://www.cs.technion.ac.il/RESEARCH_DAY_17/POSTERS/michael_riabzev.pdf
  15. ^ a b c "Scalable, transparent, and post-quantum secure computational integrity" (PDF). International Association for Cryptologic Research. March 6, 2018. Retrieved October 24, 2021. {{cite web}}: Cite uses deprecated parameter |authors= (help)
  16. ^ a b Bowe, Sean; Grigg, Jack; Hopwood, Daira (2019). "Recursive Proof Composition without a Trusted Setup". Cryptology ePrint Archive.
  17. ^ "Meet Pickles SNARK: Enabling Smart Contracts on Coda Protocol". Mina Protocol. Retrieved 2023-02-25.
  18. ^ Bonneau, Joseph; Meckler, Izaak; Rao, V.; Evan; Shapiro (2021). "Mina : Decentralized Cryptocurrency at Scale". www.semanticscholar.org. Retrieved 2023-02-25.
  19. ^ Mouris, Dimitris; Tsoutsos, Nektarios Georgios (2021). "Zilch: A Framework for Deploying Transparent Zero-Knowledge Proofs". IEEE Transactions on Information Forensics and Security. 16: 3269–3284. doi:10.1109/TIFS.2021.3074869. ISSN 1556-6021.
  20. ^ Parno, Bryan; Howell, Jon; Gentry, Craig; Raykova, Mariana (2013-05). "Pinocchio: Nearly Practical Verifiable Computation". 2013 IEEE Symposium on Security and Privacy: 238–252. doi:10.1109/SP.2013.47. {{cite journal}}: Check date values in: |date= (help)
  21. ^ Costello, Craig; Fournet, Cédric; Howell, Jon; Kohlweiss, Markulf; Kreuter, Benjamin; Naehrig, Michael; Parno, Bryan; Zahur, Samee (2015-05). "Geppetto: Versatile Verifiable Computation". 2015 IEEE Symposium on Security and Privacy: 253–270. doi:10.1109/SP.2015.23. {{cite journal}}: Check date values in: |date= (help)
  22. ^ Ben-Sasson, Eli; Chiesa, Alessandro; Genkin, Daniel; Tromer, Eran; Virza, Madars (2013). Canetti, Ran; Garay, Juan A. (eds.). "SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge". Advances in Cryptology – CRYPTO 2013. Berlin, Heidelberg: Springer: 90–108. doi:10.1007/978-3-642-40084-1_6. ISBN 978-3-642-40084-1.
  23. ^ "Efficient RAM and Control Flow in Verifiable Outsourced Computation". NDSS Symposium. doi:10.14722/ndss.2015.23097. Retrieved 2023-02-25.
  24. ^ Eberhardt, Jacob; Tai, Stefan (2018-07). "ZoKrates - Scalable Privacy-Preserving Off-Chain Computations". 2018 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData). Halifax, NS, Canada: IEEE: 1084–1091. doi:10.1109/Cybermatics_2018.2018.00199. ISBN 978-1-5386-7975-3. {{cite journal}}: Check date values in: |date= (help)
  25. ^ Kosba, Ahmed; Papamanthou, Charalampos; Shi, Elaine (2018-05). "xJsnark: A Framework for Efficient Verifiable Computation". 2018 IEEE Symposium on Security and Privacy (SP): 944–961. doi:10.1109/SP.2018.00018. {{cite journal}}: Check date values in: |date= (help)
  26. ^ Zhang, Yupeng; Genkin, Daniel; Katz, Jonathan; Papadopoulos, Dimitrios; Papamanthou, Charalampos (2018-05). "vRAM: Faster Verifiable RAM with Program-Independent Preprocessing". 2018 IEEE Symposium on Security and Privacy (SP): 908–925. doi:10.1109/SP.2018.00013. {{cite journal}}: Check date values in: |date= (help)
  27. ^ Ben-Sasson, Eli; Chiesa, Alessandro; Tromer, Eran; Virza, Madars (2014). "Succinct {Non-Interactive} Zero Knowledge for a von Neumann Architecture": 781–796. ISBN 978-1-931971-15-7. {{cite journal}}: Cite journal requires |journal= (help)
  28. ^ Kosba, Ahmed; Papadopoulos, Dimitrios; Papamanthou, Charalampos; Song, Dawn (2020). "MIRAGE: Succinct Arguments for Randomized Algorithms with Applications to Universal zk-SNARKs". Cryptology ePrint Archive.
  29. ^ Maller, Mary; Bowe, Sean; Kohlweiss, Markulf; Meiklejohn, Sarah (2019-11-06). "Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings". Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security. CCS '19. New York, NY, USA: Association for Computing Machinery: 2111–2128. doi:10.1145/3319535.3339817. ISBN 978-1-4503-6747-9.
  30. ^ Chiesa, Alessandro; Hu, Yuncong; Maller, Mary; Mishra, Pratyush; Vesely, Noah; Ward, Nicholas (2020). Canteaut, Anne; Ishai, Yuval (eds.). "Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS". Advances in Cryptology – EUROCRYPT 2020. Cham: Springer International Publishing: 738–768. doi:10.1007/978-3-030-45721-1_26. ISBN 978-3-030-45721-1.
  31. ^ Gabizon, Ariel; Williamson, Zachary J.; Ciobotaru, Oana (2019). "PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge". Cryptology ePrint Archive.
  32. ^ Bünz, Benedikt; Fisch, Ben; Szepieniec, Alan (2020). Canteaut, Anne; Ishai, Yuval (eds.). "Transparent SNARKs from DARK Compilers". Advances in Cryptology – EUROCRYPT 2020. Cham: Springer International Publishing: 677–706. doi:10.1007/978-3-030-45721-1_24. ISBN 978-3-030-45721-1.
  33. ^ Bünz, Benedikt; Bootle, Jonathan; Boneh, Dan; Poelstra, Andrew; Wuille, Pieter; Maxwell, Greg (2018-05). "Bulletproofs: Short Proofs for Confidential Transactions and More". 2018 IEEE Symposium on Security and Privacy (SP): 315–334. doi:10.1109/SP.2018.00020. {{cite journal}}: Check date values in: |date= (help)
  34. ^ Wahby, Riad S.; Tzialla, Ioanna; Shelat, Abhi; Thaler, Justin; Walfish, Michael (2018-05). "Doubly-Efficient zkSNARKs Without Trusted Setup". 2018 IEEE Symposium on Security and Privacy (SP): 926–943. doi:10.1109/SP.2018.00060. {{cite journal}}: Check date values in: |date= (help)
  35. ^ Zhang, Jiaheng; Xie, Tiancheng; Zhang, Yupeng; Song, Dawn (2020-05). "Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof". 2020 IEEE Symposium on Security and Privacy (SP): 859–876. doi:10.1109/SP40000.2020.00052. {{cite journal}}: Check date values in: |date= (help)
  36. ^ Ames, Scott; Hazay, Carmit; Ishai, Yuval; Venkitasubramaniam, Muthuramakrishnan (2017-10-30). "Ligero: Lightweight Sublinear Arguments Without a Trusted Setup". Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. CCS '17. New York, NY, USA: Association for Computing Machinery: 2087–2104. doi:10.1145/3133956.3134104. ISBN 978-1-4503-4946-8.
  37. ^ Ben-Sasson, Eli; Chiesa, Alessandro; Riabzev, Michael; Spooner, Nicholas; Virza, Madars; Ward, Nicholas P. (2019). Ishai, Yuval; Rijmen, Vincent (eds.). "Aurora: Transparent Succinct Arguments for R1CS". Advances in Cryptology – EUROCRYPT 2019. Cham: Springer International Publishing: 103–128. doi:10.1007/978-3-030-17653-2_4. ISBN 978-3-030-17653-2.
  38. ^ Ben-Sasson, Eli; Bentov, Iddo; Horesh, Yinon; Riabzev, Michael (2019). Boldyreva, Alexandra; Micciancio, Daniele (eds.). "Scalable Zero Knowledge with No Trusted Setup". Advances in Cryptology – CRYPTO 2019. Cham: Springer International Publishing: 701–732. doi:10.1007/978-3-030-26954-8_23. ISBN 978-3-030-26954-8.
  39. ^ Computing, Trustworthy (2021-08-30). "Transparent Zero-Knowledge Proofs With Zilch". Medium. Retrieved 2023-02-25.
  40. ^ Mouris, Dimitris; Tsoutsos, Nektarios Georgios (2021). "Zilch: A Framework for Deploying Transparent Zero-Knowledge Proofs". IEEE Transactions on Information Forensics and Security. 16: 3269–3284. doi:10.1109/TIFS.2021.3074869. ISSN 1556-6021.
  41. ^ Uriel Feige, Dror Lapidot, Adi Shamir: Multiple Non-Interactive Zero-Knowledge Proofs Under General Assumptions. SIAM J. Comput. 29(1): 1–28 (1999)
  42. ^ Jens Groth, Rafail Ostrovsky, Amit Sahai: Perfect Non-interactive Zero Knowledge for NP. EUROCRYPT 2006: 339–358
  43. ^ Jens Groth, Rafail Ostrovsky, Amit Sahai: Non-interactive Zaps and New Techniques for NIZK. CRYPTO 2006: 97–111
  44. ^ Jens Groth, Amit Sahai: Efficient Non-interactive Proof Systems for Bilinear Groups. EUROCRYPT 2008: 415–432
  45. ^ Jens Groth. Short Pairing-Based Non-interactive Zero-Knowledge Arguments. ASIACRYPT 2010: 321–340
  46. ^ Helger Lipmaa. Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments. TCC 2012: 169–189
Retrieved from "https://en.wikipedia.org/w/index.php?title=Non-interactive_zero-knowledge_proof&oldid=1141495777"