机读格式显示(MARC)

• 000 01988cam a2200349 i 4500

• 001 0000827345

• 003 CAL

• 005 20250816203600.0

• 008 230109s2022 mau b 000 0 eng d

• 020 __ |a 9781638281245

• 020 __ |a 1638281246

• 020 __ |z 9781638281252 |q PDF ebook

• 035 __ |a (OCoLC)1356570999

• 040 __ |a YDX |b eng |c YDX |d UKMGB |d BDX |d OCLCF |d AUXAM |d AFU |d OCLCO

• 050 _0 |a QA76.9.A25 |b T43 2022

• 082 04 |a 005.14 |2 23

• 090 __ |a TP309/X1

• 093 __ |a TP309 |2 5

• 099 __ |a CAL 022024018408

• 100 1_ |a Thaler, Justin, |e author.

• 245 10 |a Proofs, arguments, and zero-knowledge / |c Justin Thaler.

• 260 __ |a Boston : |b now, |c [2022]

• 300 __ |a 552 pages ; |c 24 cm.

• 336 __ |a text |2 rdacontent

• 337 __ |a unmediated |2 rdamedia

• 338 __ |a volume |2 rdacarrier

• 490 1_ |a Foundations and trends in privacy and security : |v volume 4, issue 2-4

• 504 __ |a Includes bibliographical references (pages 523-552).

• 505 0_ |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 |a Computer security.

• 650 _0 |a Zero-knowledge proofs.

• 650 _0 |a Cryptography.0