Pith. sign in

REVIEW 4 minor 300 references

Single-prover interactive proofs can verify AI computations that query oracles, without two debating models, when the computation is robust to small oracle errors or the oracle is low-degree.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · grok-4.5

2026-07-12 01:33 UTC pith:5T4ZOQRM

load-bearing objection Solid theory paper that actually builds single-prover relativizing DEIPs for robust oracles and low-degree oracles; the math holds, the modeling premise is the real limit.

arxiv 2607.03561 v1 pith:5T4ZOQRM submitted 2026-07-03 cs.AI cs.CCcs.CRcs.LG

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs

Liyan Chen , Yael Tauman Kalai , Zoe Xi This is my paper
classification cs.AI cs.CCcs.CRcs.LG
keywords interactive proofsAI safetyscalable oversightoracle-aided computationdoubly-efficient proofsdebaterobustnesspolynomial commitments
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper argues that scalable AI safety does not require debate between two equally powerful models. Classical single-prover interactive proofs fail for oracle-aided tasks such as checking human judgment or web data, because those proofs do not relativize. The authors build doubly-efficient single-prover protocols that work under two natural conditions: either the computation stays correct if only a small fraction of oracle answers are wrong, or the oracle itself is a low-degree polynomial. A weak verifier (for example a human) then makes far fewer oracle queries than the full computation and still catches a dishonest prover with high probability. The results show that interactive checking remains possible even when one cannot assume a second truthful model of equal strength.

Core claim

There exist doubly-efficient single-prover interactive proofs with statistical soundness and arguments with computational soundness for ε-robust oracle Boolean circuits, and a single-query argument for circuits with a polynomial-degree oracle. Verifier query complexity is O(σ/ε) or O(1/ε) in the robust setting and exactly 1 in the low-degree setting, so relativizing verification is possible without debate under structured or noise-tolerant oracle access.

What carries the argument

Interactive proofs of proximity combined with unique-decoding checksums for the adaptive robust case, and Merkle-hash or polynomial commitments plus Kilian-style succinct arguments of knowledge for the argument systems. These force any accepting transcript to be close to a correct robust computation or to match the low-degree oracle at a random point.

Load-bearing premise

The computation must remain correct even when a small fraction of its oracle answers are wrong, including after later adaptive queries recompute from those wrong answers.

What would settle it

Take a concrete oversight task such as verifying a long legal contract against human expert judgment; show that no useful ε-robust version exists without multiplying human queries by more than 1/ε, so the protocol’s claimed query savings disappear.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • Scalable oversight of long-document or web-grounded AI outputs can use one model plus a weak human checker once the task is made robust by redundancy.
  • Training labels for complex AI outputs become feasible without re-checking every oracle-dependent step.
  • Any database converted to its low-degree extension admits single-query verification of poly-size computations over it.
  • Debate’s equal-ability and truthfulness assumptions can be dropped for every task that fits the robustness or algebraic conditions.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • If everyday oversight tasks can be rewritten with majority votes or rephrased human queries, the statistical-soundness protocols become usable for alignment training today.
  • The low-degree protocol may extend to any oracle that a simple machine-learning model class approximates well, giving a route to verification over learnable oracles.
  • Measuring how far real tasks fail robustness would turn the paper’s assumption into a concrete design metric for when single-prover checking is enough and when extra debate-like redundancy is still required.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 4 minor

Summary. The paper initiates the study of single-prover doubly-efficient interactive proofs and arguments for oracle-aided Boolean circuits, motivated by scalable AI safety without the equal-ability and truthfulness assumptions of debate. It constructs four protocols: statistically sound DEIPs for ε-robust circuits with nonadaptive (Thm 4.1) and adaptive (Thm 4.5) oracle queries, a computationally sound argument for adaptive robust circuits (Thm 4.10), and a computationally sound argument for circuits with poly-degree oracles (Thm 5.4). The robust protocols combine IPPs of proximity (Rothblum–Rothblum), unique-decoding checksums, and GKR DEIPs (or Kilian SNARKs + Merkle trees); the low-degree protocol uses polynomial commitments and a Schwartz–Zippel check. Verifier query complexity is O(σ/ε) or 1, with the stated round and communication bounds summarized in Table 1.

Significance. If the modeling premises hold, the work supplies the first relativizing single-prover alternatives to debate for AI oversight, removing the need for two equally capable, properly incentivized provers. The constructions are clean reductions to standard primitives (GKR, RR20 IPPs, Kilian, lattice polynomial commitments) and give concrete, parameter-explicit efficiency trade-offs. The adaptive recursion with unique-decoding checksums (Claims 4.6–4.9) and the single-query low-degree argument are technically nontrivial contributions that enlarge the class of oracle-aided computations admitting doubly-efficient verification. The paper itself flags the empirical status of ε-robustness, so the theoretical advance is cleanly scoped.

minor comments (4)
  1. Definition 3.2 (closeness for adaptive circuits) is more involved than ordinary Hamming distance; a short illustrative example of how modifying one early answer forces recomputation of later queries would help readers who are not already familiar with adaptive oracles.
  2. In the efficiency analysis of Theorem 4.5 the eO notation hides polylog(d,S) factors; stating the precise dependence on d once (e.g., after the final complexity list) would make the comparison with the nonadaptive case sharper.
  3. Section 6 lists several open directions; a one-sentence pointer to whether the low-degree protocol already covers the “learnable oracle” case via low-degree extensions of databases would tighten the discussion.
  4. A few minor typos appear (e.g., “W e” for “We” in footnotes, inconsistent spacing around eO). A light copy-edit pass would remove them.

Circularity Check

0 steps flagged

No significant circularity; theorems are self-contained reductions to standard IPP/DEIP/Kilian/PC primitives under explicit external modeling assumptions.

full rationale

The paper constructs interactive proofs and arguments (Theorems 4.1, 4.5, 4.10, 5.4) by composing known black-box primitives (GKR15 DEIP, RR20 IPP, Kilian succinct AOK, CMNW24 polynomial commitments, Merkle hash trees, Reed-Solomon checksums) with new but non-circular protocol wrappers (checksum-augmented recursive IPPs for adaptive robustness; Schwartz-Zippel check for low-degree oracles). Completeness and soundness are proved by direct reduction to the soundness of those primitives plus the stated external hypotheses (ε-robustness of Definition 3.3, or poly-degree of the oracle). No quantity is fitted to data and then re-presented as a prediction; no uniqueness theorem is imported solely from overlapping authors to force a modeling choice; no ansatz is smuggled via self-citation; and the robustness/low-degree conditions are openly declared modeling assumptions rather than derived outputs. Self-citations (e.g., Kalai’s co-authorship of GKR15) are ordinary use of established, community-verified results and do not load-bear the novelty. The derivation chain is therefore non-circular.

Axiom & Free-Parameter Ledger

2 free parameters · 5 axioms · 0 invented entities

The central claims rest on standard complexity/crypto primitives plus two modeling hypotheses (robustness, low-degree oracles). No free parameters are fitted to data; the only free parameters are the usual soundness and proximity parameters chosen by the user. No new physical or mathematical entities are postulated.

free parameters (2)
  • ε (robustness / proximity parameter)
    User-chosen fraction; protocols scale with 1/ε. Not fitted to any dataset.
  • σ (soundness parameter)
    User-chosen repetition factor; appears linearly in communication and time. Not fitted.
axioms (5)
  • standard math Existence of collision-resistant hash functions (for Kilian arguments and hash trees)
    Invoked for Theorems 4.10 and 5.4 (Section 3.6–3.7).
  • standard math Polynomial hardness of (Module-)SIS (for extractable polynomial commitments)
    Invoked for Theorem 5.4 via CMNW24 (Section 3.8).
  • standard math GKR doubly-efficient interactive proofs for logspace-uniform circuits
    Black-box use of Theorem 3.7 in all proof systems.
  • standard math Rothblum-Rothblum interactive proofs of proximity
    Black-box use of Theorem 3.10 for the robust cases.
  • domain assumption Target computations are ε-robust (Definition 3.3) or the oracle is low-degree
    Stated as the two natural settings that restore relativization (Section 1.1); without them the impossibility of BCG25 applies.

pith-pipeline@v1.1.0-grok45 · 36625 in / 2482 out tokens · 24608 ms · 2026-07-12T01:33:46.427525+00:00 · methodology

0 comments
read the original abstract

As AI models continue to develop powerful capabilities, it becomes critical that we are able to verify that their output is aligned with our intentions. A recent line of work focuses on verification via debate, a model of interactive proofs where two competing powerful provers, or AI models, debate each other to convince a weak verifier, or a human, of the correctness of their claim. However, debate assumes that the two AI models possess equal abilities and that one of them is truthful, which may not be realistic. In this work, we show \emph{how to avoid debate}: we initiate the study of \emph{single-prover} interactive proofs for AI safety. Prior results in single-prover interactive proofs do not immediately carry over to the AI safety setting: for example, they do not work when the computation has access to an oracle, such as to human judgment or an external database such as the web. We present doubly-efficient single-prover interactive proofs and arguments for oracle-aided computations (also known as relativizing proofs), in the settings where (1) the computation is robust, in the sense that the output does not change if at most a small fraction of the answers to oracle queries are incorrect, or (2) the oracle is a low-degree polynomial. These results suggest that interactive verification is possible even without debate, under structured or noise-tolerant oracle access.

Figures

Figures reproduced from arXiv: 2607.03561 by Liyan Chen, Yael Tauman Kalai, Zoe Xi.

Figure 1
Figure 1. Figure 1: DEIP for robust circuits making nonadaptive queries [PITH_FULL_IMAGE:figures/full_fig_p018_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: DEIP for robust circuits making adaptive queries [PITH_FULL_IMAGE:figures/full_fig_p022_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Doubly-efficient interactive argument for robust circuits making adaptive queries [PITH_FULL_IMAGE:figures/full_fig_p028_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Doubly-efficient interactive argument for circuits with access to a low-degree oracle [PITH_FULL_IMAGE:figures/full_fig_p031_4.png] view at source ↗

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

300 extracted references · 14 linked inside Pith

  1. [1]

    Proceedings of the 41st International Conference on Machine Learning , pages=

    Scalable AI safety via doubly-efficient debate , author=. Proceedings of the 41st International Conference on Machine Learning , pages=

  2. [2]

    arXiv preprint arXiv:1805.00899 , year=

    AI safety via debate , author=. arXiv preprint arXiv:1805.00899 , year=

    Pith/arXiv arXiv

  3. [3]

    arXiv preprint arXiv:2506.13609 , year=

    Avoiding Obfuscation with Prover-Estimator Debate , author=. arXiv preprint arXiv:2506.13609 , year=

    Pith/arXiv arXiv

  4. [4]

    arXiv preprint arXiv:2505.03989 , year=

    An alignment safety case sketch based on debate , author=. arXiv preprint arXiv:2505.03989 , year=

    Pith/arXiv arXiv

  5. [5]

    arXiv preprint arXiv:1810.08575 , year=

    Supervising strong learners by amplifying weak experts , author=. arXiv preprint arXiv:1810.08575 , year=

    Pith/arXiv arXiv

  6. [6]

    arXiv preprint arXiv:1811.07871 , year=

    Scalable agent alignment via reward modeling: a research direction , author=. arXiv preprint arXiv:1811.07871 , year=

    Pith/arXiv arXiv

  7. [7]

    arXiv preprint arXiv:2405.15722 , year=

    Models that prove their own correctness , author=. arXiv preprint arXiv:2405.15722 , year=

    arXiv

  8. [8]

    arXiv preprint arXiv:2412.08897 , year=

    Neural interactive proofs , author=. arXiv preprint arXiv:2412.08897 , year=

    Pith/arXiv arXiv

  9. [9]

    arXiv preprint arXiv:2410.08864 , year=

    The good, the bad and the ugly: watermarks, transferable attacks and adversarial defenses , author=. arXiv preprint arXiv:2410.08864 , year=

    arXiv

  10. [10]

    arXiv preprint arXiv:2108.12099 , year=

    Learning to give checkable answers with prover-verifier games , author=. arXiv preprint arXiv:2108.12099 , year=

    Pith/arXiv arXiv

  11. [11]

    2024 , eprint=

    Interpretability Guarantees with Merlin-Arthur Classifiers , author=. 2024 , eprint=

    2024

  12. [12]

    arXiv preprint arXiv:2407.13692 , year=

    Prover-verifier games improve legibility of llm outputs , author=. arXiv preprint arXiv:2407.13692 , year=

    Pith/arXiv arXiv

  13. [13]

    Advances in Neural Information Processing Systems , volume=

    Language models don't always say what they think: Unfaithful explanations in chain-of-thought prompting , author=. Advances in Neural Information Processing Systems , volume=

  14. [14]

    arXiv preprint arXiv:2509.04664 , year=

    Why language models hallucinate , author=. arXiv preprint arXiv:2509.04664 , year=

    Pith/arXiv arXiv

  15. [15]

    arXiv preprint arXiv:2401.11817 , year=

    Hallucination is inevitable: An innate limitation of large language models , author=. arXiv preprint arXiv:2401.11817 , year=

    Pith/arXiv arXiv

  16. [16]

    Findings of the Association for Computational Linguistics: EACL 2024 , pages=

    Do language models know when they’re hallucinating references? , author=. Findings of the Association for Computational Linguistics: EACL 2024 , pages=

    2024

  17. [17]

    arXiv preprint arXiv:2406.10162 , year=

    Sycophancy to subterfuge: Investigating reward-tampering in large language models , author=. arXiv preprint arXiv:2406.10162 , year=

    Pith/arXiv arXiv

  18. [18]

    arXiv preprint arXiv:2201.03544 , year=

    The effects of reward misspecification: Mapping and mitigating misaligned models , author=. arXiv preprint arXiv:2201.03544 , year=

    Pith/arXiv arXiv

  19. [19]

    arXiv preprint arXiv:2401.05566 , year=

    Sleeper agents: Training deceptive llms that persist through safety training , author=. arXiv preprint arXiv:2401.05566 , year=

    Pith/arXiv arXiv

  20. [20]

    arXiv preprint arXiv:2509.15541 , year=

    Stress testing deliberative alignment for anti-scheming training , author=. arXiv preprint arXiv:2509.15541 , year=

    arXiv

  21. [21]

    arXiv preprint arXiv:2412.04984 , year=

    Frontier models are capable of in-context scheming , author=. arXiv preprint arXiv:2412.04984 , year=

    Pith/arXiv arXiv

  22. [22]

    Journal of the ACM (JACM) , volume=

    Delegating computation: interactive proofs for muggles , author=. Journal of the ACM (JACM) , volume=. 2015 , publisher=

    2015

  23. [23]

    Proceedings of the forty-eighth annual ACM symposium on Theory of Computing , pages=

    Constant-round interactive proofs for delegating computation , author=. Proceedings of the forty-eighth annual ACM symposium on Theory of Computing , pages=

  24. [24]

    2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages=

    Doubley-efficient interactive proofs for distribution properties , author=. 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages=. 2023 , organization=

    2023

  25. [25]

    2025 , eprint=

    Efficiently Batching Unambiguous Interactive Proofs , author=. 2025 , eprint=

    2025

  26. [26]

    Proceedings of the forty-fifth annual ACM symposium on Theory of computing , pages=

    Interactive proofs of proximity: delegating computation in sublinear time , author=. Proceedings of the forty-fifth annual ACM symposium on Theory of computing , pages=

  27. [27]

    Theory of Cryptography Conference , pages=

    Batch verification and proofs of proximity with polylog overhead , author=. Theory of Cryptography Conference , pages=. 2020 , organization=

    2020

  28. [28]

    2025 , month =

    Geoffrey Irving and Simon Marshall , title =. 2025 , month =

    2025

  29. [29]

    2020 , month =

    Barnes, Beth , title =. 2020 , month =

    2020

  30. [30]

    Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , pages=

    Making games short , author=. Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , pages=

  31. [31]

    Proceedings of the 4th conference on Innovations in Theoretical Computer Science , pages=

    Competing provers protocols for circuit evaluation , author=. Proceedings of the 4th conference on Innovations in Theoretical Computer Science , pages=

  32. [32]

    Information and Computation , volume=

    Refereed delegation of computation , author=. Information and Computation , volume=. 2013 , publisher=

    2013

  33. [33]

    Shamir, Adi , title =. J. ACM , month = oct, pages =. 1992 , issue_date =. doi:10.1145/146585.146609 , abstract =

    doi:10.1145/146585.146609 1992

  34. [34]

    Journal of the ACM (JACM) , volume=

    Probabilistic checking of proofs: A new characterization of NP , author=. Journal of the ACM (JACM) , volume=. 1998 , publisher=

    1998

  35. [35]

    Annalisa Barbara and Alessandro Chiesa and Ziyi Guan , title =

  36. [36]

    SIAM Journal on Computing , volume=

    Computationally sound proofs , author=. SIAM Journal on Computing , volume=. 2000 , publisher=

    2000

  37. [37]

    Proceedings of the twenty-fourth annual ACM symposium on Theory of computing , pages=

    A note on efficient zero-knowledge proofs and arguments , author=. Proceedings of the twenty-fourth annual ACM symposium on Theory of computing , pages=

  38. [38]

    Zaverucha and Ian Goldberg , editor =

    Aniket Kate and Gregory M. Zaverucha and Ian Goldberg , editor =. Constant-Size Commitments to Polynomials and Their Applications , booktitle =. 2010 , url =

    2010

  39. [39]

    Transactions of the Association for Computational Linguistics , volume=

    Saturated transformers are constant-depth threshold circuits , author=. Transactions of the Association for Computational Linguistics , volume=. 2022 , publisher=

    2022

  40. [40]

    The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract) , booktitle =

    Shafi Goldwasser and Silvio Micali and Charles Rackoff , editor =. The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract) , booktitle =. 1985 , url =. doi:10.1145/22145.22178 , timestamp =

    doi:10.1145/22145.22178 1985

  41. [41]

    Trading Group Theory for Randomness , booktitle =

    L. Trading Group Theory for Randomness , booktitle =. 1985 , url =. doi:10.1145/22145.22192 , timestamp =

    doi:10.1145/22145.22192 1985

  42. [42]

    Justin Thaler , title =. Found. Trends Priv. Secur. , volume =. 2022 , url =. doi:10.1561/3300000030 , timestamp =

    doi:10.1561/3300000030 2022

  43. [43]

    Annual Cryptology Conference , pages=

    Arguments of proximity , author=. Annual Cryptology Conference , pages=. 2015 , organization=

    2015

  44. [44]

    Foundations and Trends

    Pseudorandomness , author=. Foundations and Trends. 2012 , publisher=

    2012

  45. [45]

    Forgery Attacks on SipHash

    Kosuke Sasaki and Rikuto Kurahara and Kosei Sakamoto and Takanori Isobe. Forgery Attacks on SipHash. doi:10.1007/978-981-96-9095-4_1

    doi:10.1007/978-981-96-9095-4_1

  46. [46]

    Cryptanalysis of Fruit- F : Exploiting Key-Derivation Weaknesses and Initialization Vulnerabilities

    Subhadeep Banik and Hailun Yan. Cryptanalysis of Fruit- F : Exploiting Key-Derivation Weaknesses and Initialization Vulnerabilities. doi:10.1007/978-981-96-9095-4_2

    doi:10.1007/978-981-96-9095-4_2

  47. [47]

    Exploring Key-Recovery-Friendly Differential Distinguishers for SM4 and Their Performance in Differential Attacks

    Bingqing Li and Ling Sun. Exploring Key-Recovery-Friendly Differential Distinguishers for SM4 and Their Performance in Differential Attacks. doi:10.1007/978-981-96-9095-4_3

    doi:10.1007/978-981-96-9095-4_3

  48. [48]

    Inner Product Masked Integral Distinguishers and Integral Sets over Large Finite Fields - Applications to MiMC , CIMINION and Chaghri

    Weizhe Wang and Deng Tang and Haoyang Wang. Inner Product Masked Integral Distinguishers and Integral Sets over Large Finite Fields - Applications to MiMC , CIMINION and Chaghri. doi:10.1007/978-981-96-9095-4_4

    doi:10.1007/978-981-96-9095-4_4

  49. [49]

    Improved Differential Meet-in-the-Middle Cryptanalysis on SIMON and Piccolo

    Weiqing Deng and Jianing Zhang and Haoyang Wang. Improved Differential Meet-in-the-Middle Cryptanalysis on SIMON and Piccolo. doi:10.1007/978-981-96-9095-4_5

    doi:10.1007/978-981-96-9095-4_5

  50. [50]

    Strengthening Key Scheduling of AES -256 with Minimal Software Modifications

    Shoma Kawakami and Kazuma Taka and Atsushi Tanaka and Tatsuya Ishikawa and Takanori Isobe. Strengthening Key Scheduling of AES -256 with Minimal Software Modifications. doi:10.1007/978-981-96-9095-4_6

    doi:10.1007/978-981-96-9095-4_6

  51. [51]

    Ideal Transformations for Public Key Encryption

    Yao Cheng and Xianhui Lu and Ziyi Li. Ideal Transformations for Public Key Encryption. doi:10.1007/978-981-96-9095-4_7

    doi:10.1007/978-981-96-9095-4_7

  52. [52]

    Indifferentiability Separations in Ideal Public Key Encryption: Explicit vs

    Yao Cheng and Xianhui Lu and Ziyi Li and Yongjian Yin. Indifferentiability Separations in Ideal Public Key Encryption: Explicit vs. Implicit Rejection. doi:10.1007/978-981-96-9095-4_8

    doi:10.1007/978-981-96-9095-4_8

  53. [53]

    Compressed Sigma Protocols: New Model and Aggregation Techniques

    Yuxi Xue and Tianyu Zheng and Shang Gao and Bin Xiao and Man Ho Au. Compressed Sigma Protocols: New Model and Aggregation Techniques. doi:10.1007/978-981-96-9095-4_9

    doi:10.1007/978-981-96-9095-4_9

  54. [54]

    Glitter : A Fully Adaptive and Tightly Secure Threshold Signature

    Shaolong Tang and Peng Jiang and Liehuang Zhu. Glitter : A Fully Adaptive and Tightly Secure Threshold Signature. doi:10.1007/978-981-96-9095-4_10

    doi:10.1007/978-981-96-9095-4_10

  55. [55]

    Faster VOLEitH Signatures from All-But-One Vector Commitment and Half-Tree

    Dung Bui and Kelong Cong and Cyprien Delpech de Saint Guilhem. Faster VOLEitH Signatures from All-But-One Vector Commitment and Half-Tree. doi:10.1007/978-981-96-9095-4_11

    doi:10.1007/978-981-96-9095-4_11

  56. [56]

    Three-Round (Robust) Threshold ECDSA from Threshold CL Encryption

    Bowen Jiang and Guofeng Tang and Haiyang Xue. Three-Round (Robust) Threshold ECDSA from Threshold CL Encryption. doi:10.1007/978-981-96-9095-4_12

    doi:10.1007/978-981-96-9095-4_12

  57. [57]

    Lattice Attack with EHNP : Key Recovery from Two ECDSA Signatures and Breaking the Information-Theoretic Limit

    Tianyou Tang and Shuqin Fan. Lattice Attack with EHNP : Key Recovery from Two ECDSA Signatures and Breaking the Information-Theoretic Limit. doi:10.1007/978-981-96-9095-4_13

    doi:10.1007/978-981-96-9095-4_13

  58. [58]

    FlexiADKG : A Flexible Asynchronous Distributed Key Generation Protocol with Constant Round Complexity

    Yang Yang and Bingyu Li and Zhenyang Ding and Qianhong Wu and Bo Qin and Qin Wang. FlexiADKG : A Flexible Asynchronous Distributed Key Generation Protocol with Constant Round Complexity. doi:10.1007/978-981-96-9095-4_14

    doi:10.1007/978-981-96-9095-4_14

  59. [59]

    TEAKEX : TESLA -Authenticated Group Key Exchange

    Qinyi Li and Lise Millerjord and Colin Boyd. TEAKEX : TESLA -Authenticated Group Key Exchange. doi:10.1007/978-981-96-9095-4_15

    doi:10.1007/978-981-96-9095-4_15

  60. [60]

    Liu and Shirui Pan and Tsz Hon Yuen

    Qishuang Fu and Joseph K. Liu and Shirui Pan and Tsz Hon Yuen. SoK : A Deep Dive Into Anti-money Laundering Techniques for Blockchain Cryptocurrencies. doi:10.1007/978-981-96-9095-4_16

    doi:10.1007/978-981-96-9095-4_16

  61. [61]

    Advanced Temporal Graph Embedding for Detecting Fraudulent Transactions on Complex Blockchain Transactional Networks

    Jianbin Gao and Ansu Badjie and Qi Xia and Patrick Mukala and Hu Xia and Grace Mupoyi Ntuala. Advanced Temporal Graph Embedding for Detecting Fraudulent Transactions on Complex Blockchain Transactional Networks. doi:10.1007/978-981-96-9095-4_17

    doi:10.1007/978-981-96-9095-4_17

  62. [62]

    Walnut: A Generic Framework with Enhanced Scalability for BFT Protocols

    Lei Tian and Chenke Wang and Yu Long and Xian Xu and Mingchao Wan and Chunmiao Li and Shifeng Sun and Dawu Gu. Walnut: A Generic Framework with Enhanced Scalability for BFT Protocols. doi:10.1007/978-981-96-9095-4_18

    doi:10.1007/978-981-96-9095-4_18

  63. [63]

    PPSCCC : Privacy-Preserving Scalable Cross-Chain Communication Among Multiple Blockchains Based on Parent-Child Blockchain

    Hideaki Miyaji and Noriaki Kamiyama. PPSCCC : Privacy-Preserving Scalable Cross-Chain Communication Among Multiple Blockchains Based on Parent-Child Blockchain. doi:10.1007/978-981-96-9095-4_19

    doi:10.1007/978-981-96-9095-4_19

  64. [64]

    Towards Quantum Security of Hirose Compression Function and Romulus- H

    Shaoxuan Zhang and Chun Guo and Meiqin Wang. Towards Quantum Security of Hirose Compression Function and Romulus- H. doi:10.1007/978-981-96-9098-5_1

    doi:10.1007/978-981-96-9098-5_1

  65. [65]

    Efficient Multi-instance Vector Commitment and Application to Post-quantum Signatures

    Dung Bui. Efficient Multi-instance Vector Commitment and Application to Post-quantum Signatures. doi:10.1007/978-981-96-9098-5_2

    doi:10.1007/978-981-96-9098-5_2

  66. [66]

    Breaking the Shield: Novel Fault Attacks on CRYSTALS -Dilithium

    Dixiao Du and Yuejun Liu and Yiwen Gao and Jingdian Ming and Hao Yuan and Yongbin Zhou. Breaking the Shield: Novel Fault Attacks on CRYSTALS -Dilithium. doi:10.1007/978-981-96-9098-5_3

    doi:10.1007/978-981-96-9098-5_3

  67. [67]

    Efficient Revocable Identity-Based Encryption from Middle-Product LWE

    Takumi Nishimura and Atsushi Takayasu. Efficient Revocable Identity-Based Encryption from Middle-Product LWE. doi:10.1007/978-981-96-9098-5_4

    doi:10.1007/978-981-96-9098-5_4

  68. [68]

    Code-Based Fully Dynamic Accountable Ring Signatures and Group Signatures Using the Helper Methodology

    Rishiraj Bhattacharyya and Sreehari Kollath and Christophe Petit. Code-Based Fully Dynamic Accountable Ring Signatures and Group Signatures Using the Helper Methodology. doi:10.1007/978-981-96-9098-5_5

    doi:10.1007/978-981-96-9098-5_5

  69. [69]

    Partial Key Exposure Attacks on UOV and Its Variants

    Yuki Seto and Hiroki Furue and Atsushi Takayasu. Partial Key Exposure Attacks on UOV and Its Variants. doi:10.1007/978-981-96-9098-5_6

    doi:10.1007/978-981-96-9098-5_6

  70. [70]

    Unbounded Multi-hop Proxy Re-encryption with HRA Security: An LWE -Based Optimization

    Xiaohan Wan and Yang Wang and Haiyang Xue and Mingqiang Wang. Unbounded Multi-hop Proxy Re-encryption with HRA Security: An LWE -Based Optimization. doi:10.1007/978-981-96-9098-5_7

    doi:10.1007/978-981-96-9098-5_7

  71. [71]

    Fiat-Shamir with Rejection and Rotation

    Xianhui Lu and Yongjian Yin and Dingding Jia and Jingnan He and Yamin Liu and Yijian Liu and Hongbo Liu. Fiat-Shamir with Rejection and Rotation. doi:10.1007/978-981-96-9098-5_8

    doi:10.1007/978-981-96-9098-5_8

  72. [72]

    Amoeba: More Flexible RLWE -Based KEM

    Qingfeng Wang and Li-Ping Wang. Amoeba: More Flexible RLWE -Based KEM. doi:10.1007/978-981-96-9098-5_9

    doi:10.1007/978-981-96-9098-5_9

  73. [73]

    Get Rid of Templates: A Chosen-Ciphertext Attack on ML - KEM with a DPA -Based Self-comparison Oracle

    Zhenzhi Lai and Udaya Parampalli. Get Rid of Templates: A Chosen-Ciphertext Attack on ML - KEM with a DPA -Based Self-comparison Oracle. doi:10.1007/978-981-96-9098-5_10

    doi:10.1007/978-981-96-9098-5_10

  74. [74]

    Accountability for Server Misbehavior in Homomorphic Secret Sharing

    Xinzhou Wang and Shifeng Sun and Dawu Gu and Yuan Luo. Accountability for Server Misbehavior in Homomorphic Secret Sharing. doi:10.1007/978-981-96-9098-5_11

    doi:10.1007/978-981-96-9098-5_11

  75. [75]

    Jiang and Jingjing Fan and Man Ho Au and Siu Ming Yiu

    Zejiu Tan and Junping Wan and Zoe L. Jiang and Jingjing Fan and Man Ho Au and Siu Ming Yiu. High-Precision Homomorphic Modular Reduction for CKKS Bootstrapping. doi:10.1007/978-981-96-9098-5_12

    doi:10.1007/978-981-96-9098-5_12

  76. [76]

    Refined Error Management for Gate Bootstrapping

    Chunling Chen and Xianhui Lu and Binwu Xiang and Bowen Huang and Ruida Wang and Yijian Liu. Refined Error Management for Gate Bootstrapping. doi:10.1007/978-981-96-9098-5_13

    doi:10.1007/978-981-96-9098-5_13

  77. [77]

    Compact Lifting for NTT -Unfriendly Modulus

    Ying Liu and Xianhui Lu and Yu Zhang and Ruida Wang and Ziyao Liu and Kunpeng Wang. Compact Lifting for NTT -Unfriendly Modulus. doi:10.1007/978-981-96-9098-5_14

    doi:10.1007/978-981-96-9098-5_14

  78. [78]

    Guaranteed Termination Asynchronous Complete Secret Sharing with Lower Communication and Optimal Resilience

    Ying Cai and Chengyi Qin and Mingqiang Wang. Guaranteed Termination Asynchronous Complete Secret Sharing with Lower Communication and Optimal Resilience. doi:10.1007/978-981-96-9098-5_15

    doi:10.1007/978-981-96-9098-5_15

  79. [79]

    Solving Generalized Approximate Divisor Multiples Problems

    Naoki Shimoe and Noboru Kunihiro. Solving Generalized Approximate Divisor Multiples Problems. doi:10.1007/978-981-96-9098-5_16

    doi:10.1007/978-981-96-9098-5_16

  80. [80]

    Comparing and Improving Frequency Estimation Perturbation Mechanisms Under Local Differential Privacy

    She Sun and Jiafei Wu and Jian Yang and Li Zhou and Huiwen Wu. Comparing and Improving Frequency Estimation Perturbation Mechanisms Under Local Differential Privacy. doi:10.1007/978-981-96-9101-2_1

    doi:10.1007/978-981-96-9101-2_1

Showing first 80 references.