| Description |
1 online resource (504 p.) |
| Series |
Lecture Notes in Computer Science ; 14439 |
|
Lecture notes in computer science ; 14439.
|
| Contents |
Intro -- Preface -- Organization -- Contents - Part II -- Proof Systems -- Succinctness and Foundations -- Fiat-Shamir Security of FRI and Related SNARKs -- 1 Introduction -- 1.1 Our Results -- 1.2 Technical Details -- 1.3 Additional Related Work -- 1.4 Organization -- 2 Technical Overview -- 2.1 Round-by-Round Soundness and Fiat-Shamir -- 2.2 Round-by-Round Soundness of FRI -- 2.3 Correlated IOPs and Round-by-Round Knowledge Soundness -- 2.4 Round-by-Round Knowledge of Plonk-Like Protocols -- 2.5 Round-by-Round Knowledge of EthSTARK -- 2.6 From Round-by-Round Soundness to Fiat-Shamir Security |
|
3 Our Results -- 3.1 Round-by-Round Soundness of FRI and Batched FRI -- 3.2 Correlated IOPs -- 3.3 A Plonk-Like Protocol Abstraction OPlonky -- 4 Conclusions and Open Problems -- References -- On Black-Box Knowledge-Sound Commit-And-Prove SNARKs -- 1 Introduction -- 2 Technical Overview -- 2.1 Background -- 2.2 FANA Is Not Sound -- 2.3 Semi-adaptive Black-Box Knowledge-Soundness -- 2.4 New SNARK -- 2.5 Fully Algebraic F-Position-Binding Vector Commitment -- 2.6 Efficiency -- 3 Preliminaries -- 3.1 Underlying Commitment Schemes -- 3.2 QA-NIZK -- 4 New Vector Commitment Scheme -- 4.1 Definitions |
|
4.2 Construction -- 4.3 Security Analysis -- 4.4 Committing to Linear Maps -- 5 New C&P Zk-SNARK Security Notions -- 5.1 R1CS and R1CSf -- 5.2 Security Definitions -- 6 New C&P SA-SNARK Punic -- 6.1 Intuition -- 6.2 Description of Punic -- 7 Security of Punic -- 7.1 Semi-adaptive Computational (n, G)-Special-Soundness -- References -- Protostar: Generic Efficient Accumulation/Folding for Special-Sound Protocols -- 1 Introduction -- 1.1 Technical Overview -- 2 Preliminaries -- 2.1 Incremental Verifiable Computation (IVC) -- 2.2 Simple Accumulation -- 3 Protocols |
|
3.1 Special-Sound Protocols and Their Basic Transformations -- 3.2 Accumulation Scheme for Vnark -- 3.3 Compressing Verification Checks for High-Degree Verifiers -- 3.4 Computation of Error Terms -- 4 Special-Sound Subprotocols for ProtoStar -- 4.1 Permutation Relation -- 4.2 High-Degree Custom Gate Relation -- 4.3 Lookup Relation -- 4.4 Circuit Selection -- 5 Protostar -- References -- Polynomial IOPs for Memory Consistency Checks in Zero-Knowledge Virtual Machines -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Technical Overview -- 1.3 Related Works -- 2 Preliminaries |
|
2.1 Vectors and Polynomials -- 2.2 Interactive Proof System -- 2.3 Polynomial IOP -- 2.4 PIOP for Vector Languages -- 2.5 Building Blocks -- 3 The Memory Consistency Check Problem -- 4 The Sorting Paradigm -- 4.1 Contiguous Read-Only Memory -- 4.2 Read-Write Memory with 32-Bit Addresses -- 4.3 Read-Write Memory with the Full Address Space -- 5 Permem: New Construction with the Full Address Space -- 5.1 Address Cycle Method and Permem -- 5.2 Grand-Sum-Based Lookup Argument -- 6 Efficiency Analysis -- 7 Conclusion -- References -- Weak Zero-Knowledge via the Goldreich-Levin Theorem |
| Summary |
The eight-volume set LNCS 14438 until 14445 constitutes the proceedings of the 29th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2023, held in Guangzhou, China, during December 4-8, 2023. The total of 106 full papers presented in these proceedings was carefully reviewed and selected from 375 submissions. The papers were organized in topical sections as follows: Part I: Secure Multi-party computation; threshold cryptography; . Part II: proof systems - succinctness and foundations; anonymity; Part III: quantum cryptanalysis; symmetric-key cryptanalysis; Part IV: cryptanalysis of post-quantum and public-key systems; side-channels; quantum random oracle model; Part V: functional encryption, commitments and proofs; secure messaging and broadcast; Part VI: homomorphic encryption; encryption with special functionalities; security proofs and security models; Part VII: post-quantum cryptography; Part VIII: quantum cryptography; key exchange; symmetric-key design |
| Notes |
1 Introduction |
|
Includes author index |
|
Online resource; title from PDF title page (SpringerLink, viewed January 3, 2024) |
| Subject |
Computer security -- Congresses
|
|
Cryptography -- Congresses
|
|
Data encryption (Computer science) -- Congresses
|
| Form |
Electronic book
|
| Author |
Guo, Jian
|
|
Steinfeld, Ron.
|
| ISBN |
9789819987245 |
|
9819987245 |
|
