Proofs, arguments, and zero-knowledge:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boston ; Delft
now
[2022]
|
| Schriftenreihe: | Foundations and trends in privacy and security
Volume 4, Issue 2-4 |
| Schlagworte: | |
| Beschreibung: | 552 Seiten Illustrationen 24 cm |
| ISBN: | 9781638281245 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV049682630 | ||
| 003 | DE-604 | ||
| 005 | 20250116 | ||
| 007 | t| | ||
| 008 | 240513s2022 xx a||| b||| 00||| eng d | ||
| 020 | |a 9781638281245 |c Pb. |9 978-1-63828-124-5 | ||
| 035 | |a (OCoLC)1443583191 | ||
| 035 | |a (DE-599)BVBBV049682630 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 |a DE-703 | ||
| 084 | |a ST 276 |0 (DE-625)143642: |2 rvk | ||
| 100 | 1 | |a Thaler, Justin |e Verfasser |0 (DE-588)133465493X |4 aut | |
| 245 | 1 | 0 | |a Proofs, arguments, and zero-knowledge |c Justin Thaler, Georgetown University |
| 264 | 1 | |a Boston ; Delft |b now |c [2022] | |
| 264 | 4 | |c © 2022 | |
| 300 | |a 552 Seiten |b Illustrationen |c 24 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Foundations and trends in privacy and security |v Volume 4, Issue 2-4 | |
| 505 | 8 | |a 1. Introduction. 2. The Power of Randomness: Fingerprinting and Freivalds' Algorithm. 3. Definitions and Technical Preliminaries. 4. Interactive Proofs. 5. Publicly Verifiable, Non-Interactive Arguments via Fiat-Shamir. 6. Front Ends: Turning Computer Programs Into Circuits. 7. A First Succinct Argument for Circuit Satisfiability, from Interactive Proofs. 8. MIPs and Succinct Arguments. 9. PCPs and Succinct Arguments. 10. Interactive Oracle Proofs. 11. Zero-Knowledge Proofs and Arguments. 12. ∑-Protocols and Commitments from Hardness of Discrete Logarithm. 13. Zero-Knowledge via Commit-And-Prove and Masking Polynomials. 14. Polynomial Commitments from Hardness of Discrete Logarithm. 15. Polynomial Commitments from Pairings. 16. Wrap-Up of Polynomial Commitments. 17. Linear PCPs and Succinct Arguments. 18. SNARK Composition and Recursion. 19. Bird's Eye View of Practical Arguments Acknowledgements References | |
| 650 | 0 | 7 | |a Computersicherheit |0 (DE-588)4274324-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kryptologie |0 (DE-588)4033329-2 |2 gnd |9 rswk-swf |
| 653 | 0 | |a Computer security | |
| 653 | 0 | |a Zero-knowledge proofs | |
| 653 | 0 | |a Cryptography | |
| 653 | 0 | |a Sécurité informatique | |
| 653 | 0 | |a Preuves à divulgation nulle de connaissance | |
| 653 | 0 | |a Cryptographie | |
| 653 | 0 | |a Computer software / Verification | |
| 653 | 0 | |a Cryptography | |
| 689 | 0 | 0 | |a Computersicherheit |0 (DE-588)4274324-2 |D s |
| 689 | 0 | 1 | |a Kryptologie |0 (DE-588)4033329-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-1-63828-125-2 |
| 830 | 0 | |a Foundations and trends in privacy and security |v Volume 4, Issue 2-4 |w (DE-604)BV049764857 |9 4:2-4 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-035025376 | |
Datensatz im Suchindex
| _version_ | 1821395445497200640 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Thaler, Justin |
| author_GND | (DE-588)133465493X |
| author_facet | Thaler, Justin |
| author_role | aut |
| author_sort | Thaler, Justin |
| author_variant | j t jt |
| building | Verbundindex |
| bvnumber | BV049682630 |
| classification_rvk | ST 276 |
| contents | 1. Introduction. 2. The Power of Randomness: Fingerprinting and Freivalds' Algorithm. 3. Definitions and Technical Preliminaries. 4. Interactive Proofs. 5. Publicly Verifiable, Non-Interactive Arguments via Fiat-Shamir. 6. Front Ends: Turning Computer Programs Into Circuits. 7. A First Succinct Argument for Circuit Satisfiability, from Interactive Proofs. 8. MIPs and Succinct Arguments. 9. PCPs and Succinct Arguments. 10. Interactive Oracle Proofs. 11. Zero-Knowledge Proofs and Arguments. 12. ∑-Protocols and Commitments from Hardness of Discrete Logarithm. 13. Zero-Knowledge via Commit-And-Prove and Masking Polynomials. 14. Polynomial Commitments from Hardness of Discrete Logarithm. 15. Polynomial Commitments from Pairings. 16. Wrap-Up of Polynomial Commitments. 17. Linear PCPs and Succinct Arguments. 18. SNARK Composition and Recursion. 19. Bird's Eye View of Practical Arguments Acknowledgements References |
| ctrlnum | (OCoLC)1443583191 (DE-599)BVBBV049682630 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV049682630</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20250116</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">240513s2022 xx a||| b||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781638281245</subfield><subfield code="c">Pb.</subfield><subfield code="9">978-1-63828-124-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1443583191</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV049682630</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield><subfield code="a">DE-703</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 276</subfield><subfield code="0">(DE-625)143642:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Thaler, Justin</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)133465493X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proofs, arguments, and zero-knowledge</subfield><subfield code="c">Justin Thaler, Georgetown University</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston ; Delft</subfield><subfield code="b">now</subfield><subfield code="c">[2022]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2022</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">552 Seiten</subfield><subfield code="b">Illustrationen</subfield><subfield code="c">24 cm</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Foundations and trends in privacy and security</subfield><subfield code="v">Volume 4, Issue 2-4</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">1. Introduction. 2. The Power of Randomness: Fingerprinting and Freivalds' Algorithm. 3. Definitions and Technical Preliminaries. 4. Interactive Proofs. 5. Publicly Verifiable, Non-Interactive Arguments via Fiat-Shamir. 6. Front Ends: Turning Computer Programs Into Circuits. 7. A First Succinct Argument for Circuit Satisfiability, from Interactive Proofs. 8. MIPs and Succinct Arguments. 9. PCPs and Succinct Arguments. 10. Interactive Oracle Proofs. 11. Zero-Knowledge Proofs and Arguments. 12. ∑-Protocols and Commitments from Hardness of Discrete Logarithm. 13. Zero-Knowledge via Commit-And-Prove and Masking Polynomials. 14. Polynomial Commitments from Hardness of Discrete Logarithm. 15. Polynomial Commitments from Pairings. 16. Wrap-Up of Polynomial Commitments. 17. Linear PCPs and Succinct Arguments. 18. SNARK Composition and Recursion. 19. Bird's Eye View of Practical Arguments Acknowledgements References</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Computersicherheit</subfield><subfield code="0">(DE-588)4274324-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kryptologie</subfield><subfield code="0">(DE-588)4033329-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Computer security</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Zero-knowledge proofs</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Cryptography</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Sécurité informatique</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Preuves à divulgation nulle de connaissance</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Cryptographie</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Computer software / Verification</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Cryptography</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Computersicherheit</subfield><subfield code="0">(DE-588)4274324-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Kryptologie</subfield><subfield code="0">(DE-588)4033329-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-1-63828-125-2</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Foundations and trends in privacy and security</subfield><subfield code="v">Volume 4, Issue 2-4</subfield><subfield code="w">(DE-604)BV049764857</subfield><subfield code="9">4:2-4</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-035025376</subfield></datafield></record></collection> |
| id | DE-604.BV049682630 |
| illustrated | Illustrated |
| indexdate | 2025-01-16T09:00:56Z |
| institution | BVB |
| isbn | 9781638281245 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-035025376 |
| oclc_num | 1443583191 |
| open_access_boolean | |
| owner | DE-706 DE-703 |
| owner_facet | DE-706 DE-703 |
| physical | 552 Seiten Illustrationen 24 cm |
| publishDate | 2022 |
| publishDateSearch | 2022 |
| publishDateSort | 2022 |
| publisher | now |
| record_format | marc |
| series | Foundations and trends in privacy and security |
| series2 | Foundations and trends in privacy and security |
| spelling | Thaler, Justin Verfasser (DE-588)133465493X aut Proofs, arguments, and zero-knowledge Justin Thaler, Georgetown University Boston ; Delft now [2022] © 2022 552 Seiten Illustrationen 24 cm txt rdacontent n rdamedia nc rdacarrier Foundations and trends in privacy and security Volume 4, Issue 2-4 1. Introduction. 2. The Power of Randomness: Fingerprinting and Freivalds' Algorithm. 3. Definitions and Technical Preliminaries. 4. Interactive Proofs. 5. Publicly Verifiable, Non-Interactive Arguments via Fiat-Shamir. 6. Front Ends: Turning Computer Programs Into Circuits. 7. A First Succinct Argument for Circuit Satisfiability, from Interactive Proofs. 8. MIPs and Succinct Arguments. 9. PCPs and Succinct Arguments. 10. Interactive Oracle Proofs. 11. Zero-Knowledge Proofs and Arguments. 12. ∑-Protocols and Commitments from Hardness of Discrete Logarithm. 13. Zero-Knowledge via Commit-And-Prove and Masking Polynomials. 14. Polynomial Commitments from Hardness of Discrete Logarithm. 15. Polynomial Commitments from Pairings. 16. Wrap-Up of Polynomial Commitments. 17. Linear PCPs and Succinct Arguments. 18. SNARK Composition and Recursion. 19. Bird's Eye View of Practical Arguments Acknowledgements References Computersicherheit (DE-588)4274324-2 gnd rswk-swf Kryptologie (DE-588)4033329-2 gnd rswk-swf Computer security Zero-knowledge proofs Cryptography Sécurité informatique Preuves à divulgation nulle de connaissance Cryptographie Computer software / Verification Computersicherheit (DE-588)4274324-2 s Kryptologie (DE-588)4033329-2 s DE-604 Erscheint auch als Online-Ausgabe 978-1-63828-125-2 Foundations and trends in privacy and security Volume 4, Issue 2-4 (DE-604)BV049764857 4:2-4 |
| spellingShingle | Thaler, Justin Proofs, arguments, and zero-knowledge Foundations and trends in privacy and security 1. Introduction. 2. The Power of Randomness: Fingerprinting and Freivalds' Algorithm. 3. Definitions and Technical Preliminaries. 4. Interactive Proofs. 5. Publicly Verifiable, Non-Interactive Arguments via Fiat-Shamir. 6. Front Ends: Turning Computer Programs Into Circuits. 7. A First Succinct Argument for Circuit Satisfiability, from Interactive Proofs. 8. MIPs and Succinct Arguments. 9. PCPs and Succinct Arguments. 10. Interactive Oracle Proofs. 11. Zero-Knowledge Proofs and Arguments. 12. ∑-Protocols and Commitments from Hardness of Discrete Logarithm. 13. Zero-Knowledge via Commit-And-Prove and Masking Polynomials. 14. Polynomial Commitments from Hardness of Discrete Logarithm. 15. Polynomial Commitments from Pairings. 16. Wrap-Up of Polynomial Commitments. 17. Linear PCPs and Succinct Arguments. 18. SNARK Composition and Recursion. 19. Bird's Eye View of Practical Arguments Acknowledgements References Computersicherheit (DE-588)4274324-2 gnd Kryptologie (DE-588)4033329-2 gnd |
| subject_GND | (DE-588)4274324-2 (DE-588)4033329-2 |
| title | Proofs, arguments, and zero-knowledge |
| title_auth | Proofs, arguments, and zero-knowledge |
| title_exact_search | Proofs, arguments, and zero-knowledge |
| title_full | Proofs, arguments, and zero-knowledge Justin Thaler, Georgetown University |
| title_fullStr | Proofs, arguments, and zero-knowledge Justin Thaler, Georgetown University |
| title_full_unstemmed | Proofs, arguments, and zero-knowledge Justin Thaler, Georgetown University |
| title_short | Proofs, arguments, and zero-knowledge |
| title_sort | proofs arguments and zero knowledge |
| topic | Computersicherheit (DE-588)4274324-2 gnd Kryptologie (DE-588)4033329-2 gnd |
| topic_facet | Computersicherheit Kryptologie |
| volume_link | (DE-604)BV049764857 |
| work_keys_str_mv | AT thalerjustin proofsargumentsandzeroknowledge |