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

Liyan Chen; Yael Tauman Kalai; Zoe Xi

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

T0 review · 0 major / 4 minor · reviewed 2026-07-12 · grok-4.5

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

Pith's one-line read 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.

desk verdict 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. read the letter →

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

Liyan Chen , Yael Tauman Kalai , Zoe Xi This is my paper · ORCID

classification cs.AIcs.CCcs.CRcs.LG

keywords interactiveproofsAIsafetyscalableoversightoracle-aidedcomputationdoubly-efficientdebaterobustnesspolynomialcommitments

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

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.

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.

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

Extended reading notes

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.

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.

Editorial extensions

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.

Reading between the lines

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.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Desk Editor's Note

read the letter

This is the cleanest attempt so far to get single-prover interactive proofs that relativize for AI-safety-style oracles. The punchline is four concrete protocols (Theorems 4.1, 4.5, 4.10, 5.4) with explicit query, round, and time bounds: statistical DEIPs for non-adaptive and adaptive ε-robust circuits via IPP + unique-decoding checksums, a Kilian-style argument that improves the adaptive case, and a poly-commitment argument that needs only one oracle query when the oracle is low-degree.

What is new is the adaptive recursion. They commit to each adaptivity level with a Reed-Solomon checksum, run an IPP that also checks the checksums, then recurse; Claims 4.6–4.9 show that acceptance forces the extracted query-answer strings to be close enough that robustness finishes the job. The low-degree argument is the standard Schwartz-Zippel + extractable PC combination, cleanly applied. The reductions sit on GKR, RR20 IPPs, Kilian, and CMNW24 poly commitments; the proofs look complete and the complexity table is honest.

Soft spots are modeling, not math. Definition 3.3 of ε-robustness (output invariant under any ε-fraction of modified answers after adaptive recomputation) is strong; the paper flags it and suggests redundancy, but gives no evidence that real oversight tasks satisfy it. The low-degree setting is more artificial unless you low-degree-extend a database. No experiments, no code. Those are expected for this venue and do not break the theorems.

Citation pattern is appropriate: debate papers, classical IP, and the exact primitives used. No circularity.

This is for people who care about scalable oversight foundations or about relativizing interactive proofs. A serious referee should see it; the technical claims are well-supported and the gap it fills is real. I would engage.

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)

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.
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.
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.
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 · score 0.0 of 10

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.

Assumptions & free parameters 2 free parameters · 5 assumptions · 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.

assumptions (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.

how reviews work

0 comments

Cite this review

Pith. "Pith review of How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs." pith.science (2026). https://pith.science/paper/5T4ZOQRM

@misc{pith2026260703561,
  author       = {Pith},
  title        = {Pith review of: How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/5T4ZOQRM}},
  note         = {Machine review of arXiv:2607.03561}
}

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 the authors.

**Figure 2.** DEIP for robust circuits making adaptive queries [PITH_FULL_IMAGE:figures/full_fig_p022_2.png] view at source ↗

**Figure 3.** Doubly-efficient interactive argument for robust circuits making adaptive queries [PITH_FULL_IMAGE:figures/full_fig_p028_3.png] view at source ↗

Figures from the paper (1 more)

**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]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

300 extracted references · 14 linked inside Pith

[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]

arXiv preprint arXiv:1805.00899 , year=

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

arXiv
[3]

arXiv preprint arXiv:2506.13609 , year=

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

arXiv
[4]

arXiv preprint arXiv:2505.03989 , year=

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

arXiv
[5]

arXiv preprint arXiv:1810.08575 , year=

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

arXiv
[6]

arXiv preprint arXiv:1811.07871 , year=

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

arXiv
[7]

arXiv preprint arXiv:2405.15722 , year=

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

arXiv
[8]

arXiv preprint arXiv:2412.08897 , year=

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

arXiv

Show all 300 references

[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=
[10]

arXiv preprint arXiv:2108.12099 , year=

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

arXiv
[11]

2024 , eprint=

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

2024
[12]

arXiv preprint arXiv:2407.13692 , year=

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

arXiv
[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]

arXiv preprint arXiv:2509.04664 , year=

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

arXiv
[15]

arXiv preprint arXiv:2401.11817 , year=

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

arXiv
[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]

arXiv preprint arXiv:2406.10162 , year=

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

arXiv
[18]

arXiv preprint arXiv:2201.03544 , year=

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

arXiv
[19]

arXiv preprint arXiv:2401.05566 , year=

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

arXiv
[20]

arXiv preprint arXiv:2509.15541 , year=

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

arXiv preprint arXiv:2412.04984 , year=

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

arXiv
[22]

Journal of the ACM (JACM) , volume=

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

2015
[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]

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]

2025 , eprint=

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

2025
[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]

Theory of Cryptography Conference , pages=

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

2020
[28]

2025 , month =

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

2025
[29]

2020 , month =

Barnes, Beth , title =. 2020 , month =

2020
[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]

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]

Information and Computation , volume=

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

2013
[33]

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

1992 doi
[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]

Annalisa Barbara and Alessandro Chiesa and Ziyi Guan , title =
[36]

SIAM Journal on Computing , volume=

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

2000
[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]

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]

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]

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 =

1985 doi
[41]

Trading Group Theory for Randomness , booktitle =

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

1985 doi
[42]

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

2022 doi
[43]

Annual Cryptology Conference , pages=

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

2015
[44]

Foundations and Trends

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

2012
[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
[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
[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
[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
[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
[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
[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
[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
[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
[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
[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
[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
[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
[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
[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
[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
[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
[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
[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
[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
[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
[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
[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
[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
[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
[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
[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
[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
[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
[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
[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
[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
[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
[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
[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
[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
[81]

Strong Federated Authentication With Password-Based Credential Against Identity Server Corruption

Changsong Jiang and Chunxiang Xu and Guomin Yang and Li Duan and Jing Wang. Strong Federated Authentication With Password-Based Credential Against Identity Server Corruption. doi:10.1007/978-981-96-9101-2_2

doi
[82]

Anonymous Credentials with Credential Redaction and Its Application to SSI -Based Plug& Charge for Shared Vehicles

Kyosuke Hatsugai and Kyoichi Asano and Yuki Sawai and Yohei Watanabe and Mitsugu Iwamoto. Anonymous Credentials with Credential Redaction and Its Application to SSI -Based Plug& Charge for Shared Vehicles. doi:10.1007/978-981-96-9101-2_3

doi
[83]

Direction-Oriented Smooth Sensitivity and Its Application to Genomic Statistical Analysis

Akito Yamamoto and Tetsuo Shibuya. Direction-Oriented Smooth Sensitivity and Its Application to Genomic Statistical Analysis. doi:10.1007/978-981-96-9101-2_4

doi
[84]

Sentence Embedding Generation Method for Differential Privacy Protection

Yangyang Liu and Wanqi Wang and Jingyu Hua. Sentence Embedding Generation Method for Differential Privacy Protection. doi:10.1007/978-981-96-9101-2_5

doi
[85]

KD - IBMRKE - PPFL : A Privacy-Preserving Federated Learning Framework Integrating Knowledge Distillation and Identity-Based Multi-receiver Key Encapsulation

Yuan Li and Changji Wang and Shiwen Hu. KD - IBMRKE - PPFL : A Privacy-Preserving Federated Learning Framework Integrating Knowledge Distillation and Identity-Based Multi-receiver Key Encapsulation. doi:10.1007/978-981-96-9101-2_6

doi
[86]

Ebron Jr

Sheldon C. Ebron Jr. and Meiying Zhang and Kan Yang. Identifying the Truth of Global Model: A Generic Solution to Defend Against Byzantine and Backdoor Attacks in Federated Learning. doi:10.1007/978-981-96-9101-2_7

doi
[87]

RAGLeak : Membership Inference Attacks on RAG -Based Large Language Models

Kaiyue Feng and Guangsheng Zhang and Huan Tian and Heng Xu and Yanjun Zhang and Tianqing Zhu and Ming Ding and Bo Liu. RAGLeak : Membership Inference Attacks on RAG -Based Large Language Models. doi:10.1007/978-981-96-9101-2_8

doi
[88]

Zhenzhu Chen and Yansong Gao and Anmin Fu and Fanjian Zeng and Boyu Kuang and Robert H. Deng. DeGain : Detecting GAN -Based Data Inversion in Collaborative Deep Learning. doi:10.1007/978-981-96-9101-2_9

doi
[89]

FRFL : Fair and Robust Federated Learning Incentive Model Based on Game Theory

Haocheng Ye and Lu Zhou and Hao Wang and Chunpeng Ge. FRFL : Fair and Robust Federated Learning Incentive Model Based on Game Theory. doi:10.1007/978-981-96-9101-2_10

doi
[90]

DPFedSub : A Differentially Private Federated Learning with Randomized Subspace Descend

Huiwen Wu and Chuan Ma and Xueran Li and Deyi Zhang and Xiaohan Li and She Sun. DPFedSub : A Differentially Private Federated Learning with Randomized Subspace Descend. doi:10.1007/978-981-96-9101-2_11

doi
[91]

MG -Det: Deepfake Detection with Multi-granularity

Ahmed Asiri and Luoyu Chen and Zhiyi Tian and Xiaoyu Ding and Shui Yu. MG -Det: Deepfake Detection with Multi-granularity. doi:10.1007/978-981-96-9101-2_12

doi
[92]

LPIA : Label Preference Inference Attack Against Federated Graph Learning

Jiaxue Bai and Lu Shi and Yang Liu and Weizhe Zhang. LPIA : Label Preference Inference Attack Against Federated Graph Learning. doi:10.1007/978-981-96-9101-2_13

doi
[93]

Kanhere and Jiamou Sun and Sanjay K

Lihua Wang and Jiaojiao Jiang and Salil S. Kanhere and Jiamou Sun and Sanjay K. Jha and Zhenchang Xing. DARA : Enhancing Vulnerability Alignment via Adaptive Reconstruction and Dual-Level Attention. doi:10.1007/978-981-96-9101-2_14

doi
[94]

Zeroth-Order Federated Private Tuning for Pretrained Large Language Models

Xiaoyu Zhang and Yong Lin and Meixia Miao and Jian Lou and Jin Li and Xiaofeng Chen. Zeroth-Order Federated Private Tuning for Pretrained Large Language Models. doi:10.1007/978-981-96-9101-2_15

doi
[95]

Guanqin Zhang and Feng Xu and H. M. N. Dilum Bandara and Shiping Chen and Yulei Sui. Understanding the Robustness of Machine-Unlearning Models. doi:10.1007/978-981-96-9101-2_16

doi
[96]

Mitigating the Unprivileged User Namespaces Based Privilege Escalation Attacks with Linux Capabilities

Jingzi Meng and Yuewu Wang and Lingguang Lei and Chunjing Kou and Peng Wang and Huawei Lu. Mitigating the Unprivileged User Namespaces Based Privilege Escalation Attacks with Linux Capabilities. doi:10.1007/978-981-96-9101-2_17

doi
[97]

SoK : From Systematization to Best Practices in Fuzz Driver Generation

Qian Yan and Minhuan Huang and Huayang Cao and Shuaibing Lu. SoK : From Systematization to Best Practices in Fuzz Driver Generation. doi:10.1007/978-981-96-9101-2_18

doi
[98]

Facial Authentication Security Evaluation Against Deepfake Attacks in Mobile Apps

Chuer Yu and Siyi Xia and Haoyu Wang and Xia Liu and Zonghui Wang and Lirong Fu and Zhiyuan Wan and Yandong Gao and Yang Xiang and Wenzhi Chen. Facial Authentication Security Evaluation Against Deepfake Attacks in Mobile Apps. doi:10.1007/978-981-96-9101-2_19

doi
[99]

EAPIR : Efficient and Authenticated Private Information Retrieval with Fast Server Processing

Hua Shen and Xinjie Li and Zhen Fan and Ge Wu and Mingwu Zhang. EAPIR : Efficient and Authenticated Private Information Retrieval with Fast Server Processing. doi:10.1007/978-981-96-9101-2_20

doi
[100]

Arash Mahboubi and Hamed Aboutorab and Seyit Camtepe and Hang Thanh Bui and Khanh Luong and Keyvan Ansari and Shenlu Wang and Bazara I. A. Barry. Ransomware Encryption Detection: Adaptive File System Analysis Against Evasive Encryption Tactics. doi:10.1007/978-981-96-9101-2_21

doi
[101]

Receiver-Initiated Updatable Public Key Encryption: Construction, Security and Application

Jiahao Xuan. Receiver-Initiated Updatable Public Key Encryption: Construction, Security and Application. doi:10.1007/978-981-96-9101-2_22

doi
[102]

Robust and Privacy-Preserving Dynamic Average Consensus with Individual Weight

Yuanyuan Zhang and Yu Liu and Yahui Wang and Tianqing Zhu and Mingwu Zhang. Robust and Privacy-Preserving Dynamic Average Consensus with Individual Weight. doi:10.1007/978-981-96-9101-2_23

doi
[103]

Improving RSA Cryptanalysis: Combining Continued Fractions and Coppersmith's Techniques

Mengce Zheng and Yansong Feng and Abderrahmane Nitaj and Yanbin Pan. Improving RSA Cryptanalysis: Combining Continued Fractions and Coppersmith's Techniques. doi:10.1007/978-981-96-9101-2_24

doi
[104]

Shortest Printable Shellcode Encoding Algorithm Based on Dynamic Bitwidth Selection

Guoan Liu and Jian Lin and Weiyu Dong and Jiaan Liu and Tieming Liu. Shortest Printable Shellcode Encoding Algorithm Based on Dynamic Bitwidth Selection. doi:10.1007/978-981-96-9101-2_25

doi
[105]

Bridging Clone Detection and Industrial Compliance: A Practical Pipeline for Enterprise Codebases

Xiaowei Zhang and Shigang Liu and Jun Zhang and Yang Xiang. Bridging Clone Detection and Industrial Compliance: A Practical Pipeline for Enterprise Codebases. doi:10.1007/978-981-96-9101-2_26

doi
[106]

The Offline Quantum Attack Against Modular Addition Variant of Even - Mansour Cipher

Fangzhou Liu and Xueqi Zhu and Ruozhou Xu and Danping Shi and Peng Wang. The Offline Quantum Attack Against Modular Addition Variant of Even - Mansour Cipher. doi:10.1007/978-981-97-5025-2_1

doi
[107]

Known-Key Attack on GIFT -64 and GIFT -64 [g_0^c] Based on Correlation Matrices

Xiaomeng Sun and Wenying Zhang and Ren \'e Rodr \'i guez and Huimin Liu. Known-Key Attack on GIFT -64 and GIFT -64 [g_0^c] Based on Correlation Matrices. doi:10.1007/978-981-97-5025-2_2

doi
[108]

On the Security Bounds for Block Ciphers Without Whitening Key Addition Against Integral Distinguishers

Fanyang Zeng and Tian Tian. On the Security Bounds for Block Ciphers Without Whitening Key Addition Against Integral Distinguishers. doi:10.1007/978-981-97-5025-2_3

doi
[109]

Tight Multi-user Security of Ascon and Its Large Key Extension

Bishwajit Chakraborty and Chandranan Dhar and Mridul Nandi. Tight Multi-user Security of Ascon and Its Large Key Extension. doi:10.1007/978-981-97-5025-2_4

doi
[110]

Differential Distinguishing Attacks on SNOW - V , SNOW -Vi and KCipher -2

Rikuto Kurahara and Kosei Sakamoto and Yuto Nakano and Takanori Isobe. Differential Distinguishing Attacks on SNOW - V , SNOW -Vi and KCipher -2. doi:10.1007/978-981-97-5025-2_5

doi
[111]

Efficient Search for Optimal Permutations of Refined Type- II Generalized Feistel Structures

Xiaodan Li and Wenling Wu and Yuhan Zhang and Ee Duan. Efficient Search for Optimal Permutations of Refined Type- II Generalized Feistel Structures. doi:10.1007/978-981-97-5025-2_6

doi
[112]

Man Chen and Yuyue Chen and Rui Zong and ZengPeng Li and Zoe L. Jiang. F- FHEW : High-Precision Approximate Homomorphic Encryption with Batch Bootstrapping. doi:10.1007/978-981-97-5025-2_7

doi
[113]

Robin Jadoul and Axel Mertens and Jeongeun Park and Hilder V. L. Pereira. NTRU -Based FHE for Larger Key and Message Space. doi:10.1007/978-981-97-5025-2_8

doi
[114]

Jiang and Jun Zhou and Junbin Fang and Zhenfu Cao

Yi Huang and Junping Wan and Zoe L. Jiang and Jun Zhou and Junbin Fang and Zhenfu Cao. An Efficient Integer-Wise ReLU on TFHE. doi:10.1007/978-981-97-5025-2_9

doi
[115]

HERatio : Homomorphic Encryption of Rationals Using Laurent Polynomials

Luke Harmon and Gaetan Delavignette and Hanes Oliveira. HERatio : Homomorphic Encryption of Rationals Using Laurent Polynomials. doi:10.1007/978-981-97-5025-2_10

doi
[116]

TFHE Bootstrapping: Faster, Smaller and Time-Space Trade-Offs

Ruida Wang and Benqiang Wei and Zhihao Li and Xianhui Lu and Kunpeng Wang. TFHE Bootstrapping: Faster, Smaller and Time-Space Trade-Offs. doi:10.1007/978-981-97-5025-2_11

doi
[117]

Approximate Methods for the Computation of Step Functions in Homomorphic Encryption

Tairong Huang and Shihe Ma and Anyu Wang and Xiaoyun Wang. Approximate Methods for the Computation of Step Functions in Homomorphic Encryption. doi:10.1007/978-981-97-5025-2_12

doi
[118]

Key Cooperative Attribute-Based Encryption

Luqi Huang and Willy Susilo and Guomin Yang and Fuchun Guo. Key Cooperative Attribute-Based Encryption. doi:10.1007/978-981-97-5025-2_13

doi
[119]

On the Feasibility of Identity-Based Encryption with Equality Test Against Insider Attacks

Keita Emura. On the Feasibility of Identity-Based Encryption with Equality Test Against Insider Attacks. doi:10.1007/978-981-97-5025-2_14

doi
[120]

Non-interactive Publicly Verifiable Searchable Encryption with Forward and Backward Privacy

Zhilong Luo and Shifeng Sun and Zhedong Wang and Dawu Gu. Non-interactive Publicly Verifiable Searchable Encryption with Forward and Backward Privacy. doi:10.1007/978-981-97-5025-2_15

doi
[121]

On the Implications from Updatable Encryption to Public-Key Cryptographic Primitives

Yuichi Tanishita and Ryuya Hayashi and Ryu Ishii and Takahiro Matsuda and Kanta Matsuura. On the Implications from Updatable Encryption to Public-Key Cryptographic Primitives. doi:10.1007/978-981-97-5025-2_16

doi
[122]

Continuous Version of Non-malleable Codes from Authenticated Encryption

Anit Kumar Ghosal and Dipanwita Roychowdhury. Continuous Version of Non-malleable Codes from Authenticated Encryption. doi:10.1007/978-981-97-5025-2_17

doi
[123]

Pairing-Free ID -Based Signatures as Secure as Discrete Logarithm in AGM

Jia-Chng Loh and Fuchun Guo and Willy Susilo. Pairing-Free ID -Based Signatures as Secure as Discrete Logarithm in AGM. doi:10.1007/978-981-97-5025-2_18

doi
[124]

Threshold Ring Signatures with Accountability

Thanh Xuan Khuc and Willy Susilo and Dung Hoang Duong and Fuchun Guo and Kazuhide Fukushima and Shinsaku Kiyomoto. Threshold Ring Signatures with Accountability. doi:10.1007/978-981-97-5025-2_19

doi
[125]

Threshold Signatures with Private Accountability via Secretly Designated Witnesses

Meng Li and Hanni Ding and Qing Wang and Zijian Zhang and Mauro Conti. Threshold Signatures with Private Accountability via Secretly Designated Witnesses. doi:10.1007/978-981-97-5025-2_20

doi
[126]

A Novel Window NAF on Koblitz Curves

Xiuxiu Li and Wei Yu and Kunpeng Wang. A Novel Window NAF on Koblitz Curves. doi:10.1007/978-981-97-5025-2_21

doi
[127]

Parallel Algorithms on Hyperelliptic Pairings Using Hyperelliptic Nets

Chao Chen and Fangguo Zhang. Parallel Algorithms on Hyperelliptic Pairings Using Hyperelliptic Nets. doi:10.1007/978-981-97-5025-2_22

doi
[128]

AlgSAT - A SAT Method for Verification of Differential Trails from an Algebraic Perspective

Huina Li and Haochen Zhang and Kai Hu and Guozhen Liu and Weidong Qiu. AlgSAT - A SAT Method for Verification of Differential Trails from an Algebraic Perspective. doi:10.1007/978-981-97-5025-2_23

doi
[129]

Hadamard Product Argument from Lagrange-Based Univariate Polynomials

Jie Xie and Yuncong Hu and Yu Yu. Hadamard Product Argument from Lagrange-Based Univariate Polynomials. doi:10.1007/978-981-97-5025-2_24

doi
[130]

Improved Multimodal Private Signatures from Lattices

Nam Tran and Khoa Nguyen and Dongxi Liu and Josef Pieprzyk and Willy Susilo. Improved Multimodal Private Signatures from Lattices. doi:10.1007/978-981-97-5028-3_1

doi
[131]

Automatic Quantum Multi-collision Distinguishers and Rebound Attacks with Triangulation Algorithm

Zhenzhen Bao and Jian Guo and Shun Li and Phuong Pham. Automatic Quantum Multi-collision Distinguishers and Rebound Attacks with Triangulation Algorithm. doi:10.1007/978-981-97-5028-3_2

doi
[132]

Lattice-Based, More General Anti-leakage Model and Its Application in Decentralization

Xiaokang Dai and Jingwei Chen and Wenyuan Wu and Yong Feng. Lattice-Based, More General Anti-leakage Model and Its Application in Decentralization. doi:10.1007/978-981-97-5028-3_3

doi
[133]

An Efficient Hardware Implementation of Crystal- Dilithium on FPGA

Zixuan Wu and Rongmao Chen and Yi Wang and Qiong Wang and Wei Peng. An Efficient Hardware Implementation of Crystal- Dilithium on FPGA. doi:10.1007/978-981-97-5028-3_4

doi
[134]

Pushing the Limit of Vectorized Polynomial Multiplications for NTRU Prime

Vincent Hwang. Pushing the Limit of Vectorized Polynomial Multiplications for NTRU Prime. doi:10.1007/978-981-97-5028-3_5

doi
[135]

Jumping for Bernstein-Yang Inversion

Li-Jie Jian and Ting-Yuan Wang and Bo-Yin Yang and Ming-Shing Chen. Jumping for Bernstein-Yang Inversion. doi:10.1007/978-981-97-5028-3_6

doi
[136]

Liu and Muhammed F

Xinyu Zhang and Ron Steinfeld and Joseph K. Liu and Muhammed F. Esgin and Dongxi Liu and Sushmita Ruj. DualRing - PRF : Post-quantum (Linkable) Ring Signatures from Legendre and Power Residue PRFs. doi:10.1007/978-981-97-5028-3_7

doi
[137]

Faster Verifications and Smaller Signatures: Trade-Offs for ALTEQ Using Rejections

Arnaud Sipasseuth. Faster Verifications and Smaller Signatures: Trade-Offs for ALTEQ Using Rejections. doi:10.1007/978-981-97-5028-3_8

doi
[138]

Revisiting the Security of Fiat-Shamir Signature Schemes Under Superposition Attacks

Quan Yuan and Chao Sun and Tsuyoshi Takagi. Revisiting the Security of Fiat-Shamir Signature Schemes Under Superposition Attacks. doi:10.1007/978-981-97-5028-3_9

doi
[139]

Improved Lattice-Based Attack on Mersenne Low Hamming Ratio Search Problem

Mengce Zheng and Wei Yan. Improved Lattice-Based Attack on Mersenne Low Hamming Ratio Search Problem. doi:10.1007/978-981-97-5028-3_10

doi
[140]

New Strategy for Evaluating Differential Clustering Effect of uBlock

Chen Wang and Jinliang Wang and Muzhou Li and Meiqin Wang. New Strategy for Evaluating Differential Clustering Effect of uBlock. doi:10.1007/978-981-97-5028-3_11

doi
[141]

Algebraic Cryptanalysis of the HADES Design Strategy: Application to Poseidon and Poseidon2

Tomer Ashur and Thomas Buschman and Mohammad Mahzoun. Algebraic Cryptanalysis of the HADES Design Strategy: Application to Poseidon and Poseidon2. doi:10.1007/978-981-97-5028-3_12

doi
[142]

Revisiting Impossible Differential Cryptanalysis and Expanding the Application of MILP in Impossible Differential Attack

Weiwei Cao. Revisiting Impossible Differential Cryptanalysis and Expanding the Application of MILP in Impossible Differential Attack. doi:10.1007/978-981-97-5028-3_13

doi
[143]

A Fault-Tolerant Content Moderation Mechanism for Secure Messaging Systems

Tuong Ngoc Nguyen and Willy Susilo and Dung Hoang Duong and Fuchun Guo and Kazuhide Fukushima and Shinsaku Kiyomoto. A Fault-Tolerant Content Moderation Mechanism for Secure Messaging Systems. doi:10.1007/978-981-97-5028-3_14

doi
[144]

Formal Verification of Challenge Flow in EMV 3- D Secure

Kakeru Watanabe and Kazuki Yoneyama. Formal Verification of Challenge Flow in EMV 3- D Secure. doi:10.1007/978-981-97-5028-3_15

doi
[145]

Size-Hiding Computation in the Honest-But-Curious Model

Kazumasa Shinagawa. Size-Hiding Computation in the Honest-But-Curious Model. doi:10.1007/978-981-97-5028-3_16

doi
[146]

o rre and Jeremias Mechler and J \

Saskia Bayreuther and Robin Berger and Felix D \"o rre and Jeremias Mechler and J \"o rn M \"u ller-Quade. Hidden -Fairness: A Novel Notion for Fair Secure Two-Party Computation. doi:10.1007/978-981-97-5028-3_17

doi
[147]

ProfistMAC : A Protocol Finite State Machine Classifier via Graph Representation

Yali Yuan and Yichao Wang and Guang Cheng. ProfistMAC : A Protocol Finite State Machine Classifier via Graph Representation. doi:10.1007/978-981-97-5028-3_18

doi
[148]

Subverting Cryptographic Protocols from a Fine-Grained Perspective- A Case Study on 2-Party ECDSA

Jialiu Cheng and Yi Wang and Rongmao Chen and Xinyi Huang. Subverting Cryptographic Protocols from a Fine-Grained Perspective- A Case Study on 2-Party ECDSA. doi:10.1007/978-981-97-5028-3_19

doi
[149]

Deep Dive on Relationship Between Personality and Password Creation

Madeline Moran and Arrianna Szymczak and Anna Hart and Shelia Kennison and Eric Chan-Tin. Deep Dive on Relationship Between Personality and Password Creation. doi:10.1007/978-981-97-5028-3_20

doi
[150]

Unveiling the Unseen: Video Recognition Attacks on Social Software

Hangyu Zhao and Hua Wu and Xuqiong Bian and Songtao Liu and Guang Cheng and Xiaoyan Hu and Zhiyi Tian. Unveiling the Unseen: Video Recognition Attacks on Social Software. doi:10.1007/978-981-97-5028-3_21

doi
[151]

An Account Matching Method Based on Hyper Graph

Zhiwei Tang and Xuemeng Zhai and Gaolei Fei and Junyi Gao and Jianwei Ding and Keren Wang and Qiang Li and Guangmin Hu. An Account Matching Method Based on Hyper Graph. doi:10.1007/978-981-97-5028-3_22

doi
[152]

Enhancing Permissioned Blockchains with Controlled Data Authorization

Qichang Liu and Xufeng Zhang and Sisi Duan and Haibin Zhang. Enhancing Permissioned Blockchains with Controlled Data Authorization. doi:10.1007/978-981-97-5101-3_1

doi
[153]

FXChain : A Multi-consortium Permissioned Blockchain with Flexible Privacy-Preserving Strategies

Zenan Lou and Na Ruan and Yuxiang Cai. FXChain : A Multi-consortium Permissioned Blockchain with Flexible Privacy-Preserving Strategies. doi:10.1007/978-981-97-5101-3_2

doi
[154]

Efficient Vulnerability Detection for Smart Contracts Using Gated Graph Neural Network

Yiwen Zhai and Jia Yang and Mingwu Zhang. Efficient Vulnerability Detection for Smart Contracts Using Gated Graph Neural Network. doi:10.1007/978-981-97-5101-3_3

doi
[155]

Lightweight Instance Batch Schemes Towards Prover-Efficient Decentralized Private Computation

Ziyu Meng and Zibo Zhou and Zongyang Zhang and Yu Jin. Lightweight Instance Batch Schemes Towards Prover-Efficient Decentralized Private Computation. doi:10.1007/978-981-97-5101-3_4

doi
[156]

CrossAAD : Cross-Chain Abnormal Account Detection

Yong Lin and Peng Jiang and Fuchun Guo and Liehuang Zhu. CrossAAD : Cross-Chain Abnormal Account Detection. doi:10.1007/978-981-97-5101-3_5

doi
[157]

Jun Zhao and Jiangshan Yu and Xingliang Yuan and Joseph K. Liu. AegisDB : Scalable Blockchain Database with Secure Decentralised Load Balancing. doi:10.1007/978-981-97-5101-3_6

doi
[158]

Towards Scalable and Secure IoTs Transactions: A New Bi-directional Payment Channel Without Third-Party Monitoring

Zuobin Ying and Qingao Ding and Wenqi Li and Shengmin Xu and Jinbo Xiong. Towards Scalable and Secure IoTs Transactions: A New Bi-directional Payment Channel Without Third-Party Monitoring. doi:10.1007/978-981-97-5101-3_7

doi
[159]

Understanding Privacy in Smart Speakers: A Narrative Review

Abdulrhman Alorini and Abdullah Bin Sawad and Sultan Alharbi and Kiran Ijaz and Mukesh Prasad and Ahmet Baki Kocaballi. Understanding Privacy in Smart Speakers: A Narrative Review. doi:10.1007/978-981-97-5101-3_8

doi
[160]

R- PPDFL : A Robust and Privacy-Preserving Decentralized Federated Learning System

Tao Chen and Xiaofen Wang and Hong-Ning Dai. R- PPDFL : A Robust and Privacy-Preserving Decentralized Federated Learning System. doi:10.1007/978-981-97-5101-3_9

doi
[161]

FedSCD : Federated Learning with Semi-centralization, Discrepancy-Awareness and Dual-Model Collaboration

Changji Wang and Canjie Pan and Qingqing Gan and Zhen Liu and Ning Liu and Jingjing Zhang. FedSCD : Federated Learning with Semi-centralization, Discrepancy-Awareness and Dual-Model Collaboration. doi:10.1007/978-981-97-5101-3_10

doi
[162]

Pirates: Anonymous Group Calls over Fully Untrusted Infrastructure

Christoph Coijanovic and Akim Stark and Daniel Schadt and Thorsten Strufe. Pirates: Anonymous Group Calls over Fully Untrusted Infrastructure. doi:10.1007/978-981-97-5101-3_11

doi
[163]

Liu and Xingliang Yuan and Shifeng Sun and Hui Cui

Yanjun Shen and Joseph K. Liu and Xingliang Yuan and Shifeng Sun and Hui Cui. SecuPath : A Secure and Privacy-Preserving Multiparty Path Planning Framework in UAV Applications. doi:10.1007/978-981-97-5101-3_12

doi
[164]

TS - HMD : Explainable Deep Learning for Time Series HPCs Based IoT Malware Detection

Xiangyi Wang and Jian Zhang and Zheng Meng. TS - HMD : Explainable Deep Learning for Time Series HPCs Based IoT Malware Detection. doi:10.1007/978-981-97-5101-3_13

doi
[165]

Security Research for Android Remote Assistance Apps

Liwei Wang and Xiaofeng Liu and Ting Lei and Wenna Song and Shanqing Guo and Pengcheng Ren. Security Research for Android Remote Assistance Apps. doi:10.1007/978-981-97-5101-3_14

doi
[166]

SynBoost : Robust Text Generation Model via Beam Search and Synonym-Driven Boosting

Depeng Chen and Mengdie Xia and Jie Cui. SynBoost : Robust Text Generation Model via Beam Search and Synonym-Driven Boosting. doi:10.1007/978-981-97-5101-3_15

doi
[167]

CCE & D : A Configuration Failure Prevention Method for Autonomous Driving Systems

Yanqiu Zhang and Xiao Yu and Jinzhao Liu and Li Zhang and Yuanzhang Li and Yuan Tan. CCE & D : A Configuration Failure Prevention Method for Autonomous Driving Systems. doi:10.1007/978-981-97-5101-3_16

doi
[168]

Action-Driven UAV Fingerprint Verification with Perception Data

Yuxin Liu and Ning Xi and Ruidong Han and Yuanzhao Li and Jian Feng Ma and Yulong Shen. Action-Driven UAV Fingerprint Verification with Perception Data. doi:10.1007/978-981-97-5101-3_17

doi
[169]

AggNoteBot : A Robust Botnet Building Using Aggressive Cloud Notes

Siyu Li and Yi-Ning Liu and Fei Zhou and Yanze Kang and Weizhi Meng. AggNoteBot : A Robust Botnet Building Using Aggressive Cloud Notes. doi:10.1007/978-981-97-5101-3_18

doi
[170]

FSAM Framework for Online CDN -Based Website Classification

Yulong Zhan and Yang Cai and Gang Xiong and Gaopeng Gou and Xiaoqian Li. FSAM Framework for Online CDN -Based Website Classification. doi:10.1007/978-981-97-5101-3_19

doi
[171]

Towards Private Multi-operator Network Slicing

Blake Haydon and Shangqi Lai and Xingliang Yuan and Sharif Abuadbba and Carsten Rudolph. Towards Private Multi-operator Network Slicing. doi:10.1007/978-981-97-5101-3_20

doi
[172]

An Encrypted Traffic Classification Framework Based on Higher-Interaction-Graph Neural Network

Zitong Hu and Bo Qu and Xiang Li and Cong Li. An Encrypted Traffic Classification Framework Based on Higher-Interaction-Graph Neural Network. doi:10.1007/978-981-97-5101-3_21

doi
[173]

PassTSL : Modeling Human-Created Passwords Through Two-Stage Learning

Haozhang Li and Yangde Wang and Weidong Qiu and Shujun Li and Peng Tang. PassTSL : Modeling Human-Created Passwords Through Two-Stage Learning. doi:10.1007/978-981-97-5101-3_22

doi
[174]

Liu and Xiaoning Du

Peter Ince and Xiapu Luo and Jiangshan Yu and Joseph K. Liu and Xiaoning Du. Detect Llama - Finding Vulnerabilities in Smart Contracts Using Large Language Models. doi:10.1007/978-981-97-5101-3_23

doi
[175]

MMOOC : A Multimodal Misinformation Dataset for Out-of-Context News Analysis

Qingzheng Xu and Heming Du and Huiqiang Chen and Bo Liu and Xin Yu. MMOOC : A Multimodal Misinformation Dataset for Out-of-Context News Analysis. doi:10.1007/978-981-97-5101-3_24

doi
[176]

Improved Differential Cryptanalysis on SPECK Using Plaintext Structures

Zhuohui Feng and Ye Luo and Chao Wang and Qianqian Yang and Zhiquan Liu and Ling Song. Improved Differential Cryptanalysis on SPECK Using Plaintext Structures. doi:10.1007/978-3-031-35486-1_1

doi
[177]

Linear Cryptanalysis and Its Variants with Fast Fourier Transformation Technique on MPC / FHE / ZK -Friendly F _p -Based Ciphers

Zeyu Xu and Shiyao Chen and Meiqin Wang and Puwen Wei. Linear Cryptanalysis and Its Variants with Fast Fourier Transformation Technique on MPC / FHE / ZK -Friendly F _p -Based Ciphers. doi:10.1007/978-3-031-35486-1_2

doi
[178]

A New Correlation Cube Attack Based on Division Property

Cheng Che and Tian Tian. A New Correlation Cube Attack Based on Division Property. doi:10.1007/978-3-031-35486-1_3

doi
[179]

The Triangle Differential Cryptanalysis

Xiaofeng Xie and Tian Tian. The Triangle Differential Cryptanalysis. doi:10.1007/978-3-031-35486-1_4

doi
[180]

Key Recovery Attacks on Grain -Like Keystream Generators with Key Injection

Matthew Beighton and Harry Bartlett and Leonie Simpson and Kenneth Koon-Ho Wong. Key Recovery Attacks on Grain -Like Keystream Generators with Key Injection. doi:10.1007/978-3-031-35486-1_5

doi
[181]

Related-Cipher Attacks: Applications to Ballet and ANT

Yongxia Mao and Wenling Wu and Yafei Zheng and Lei Zhang. Related-Cipher Attacks: Applications to Ballet and ANT. doi:10.1007/978-3-031-35486-1_6

doi
[182]

Cryptanalysis of SPEEDY

Jinliang Wang and Chao Niu and Qun Liu and Muzhou Li and Bart Preneel and Meiqin Wang. Cryptanalysis of SPEEDY. doi:10.1007/978-3-031-35486-1_7

doi
[183]

Reconsidering Generic Composition: The Modes A10 , A11 and A12 are Insecure

Francesco Berti. Reconsidering Generic Composition: The Modes A10 , A11 and A12 are Insecure. doi:10.1007/978-3-031-35486-1_8

doi
[184]

Exploring Formal Methods for Cryptographic Hash Function Implementations

Nicky Mouha. Exploring Formal Methods for Cryptographic Hash Function Implementations. doi:10.1007/978-3-031-35486-1_9

doi
[185]

A Tightly Secure ID -Based Signature Scheme Under DL Assumption in AGM

Jia-Chng Loh and Fuchun Guo and Willy Susilo and Guomin Yang. A Tightly Secure ID -Based Signature Scheme Under DL Assumption in AGM. doi:10.1007/978-3-031-35486-1_10

doi
[186]

Compact Password Authenticated Key Exchange from Group Actions

Ren Ishibashi and Kazuki Yoneyama. Compact Password Authenticated Key Exchange from Group Actions. doi:10.1007/978-3-031-35486-1_11

doi
[187]

Multi-key Homomorphic Secret Sharing from LWE Without Multi-key HE

Peiying Xu and Li-Ping Wang. Multi-key Homomorphic Secret Sharing from LWE Without Multi-key HE. doi:10.1007/978-3-031-35486-1_12

doi
[188]

Identity-Based Encryption from Lattices Using Approximate Trapdoors

Malika Izabach \`e ne and Lucas Prabel and Adeline Roux-Langlois. Identity-Based Encryption from Lattices Using Approximate Trapdoors. doi:10.1007/978-3-031-35486-1_13

doi
[189]

Homomorphic Signatures for Subset and Superset Mixed Predicates and Its Applications

Masahito Ishizaka and Kazuhide Fukushima. Homomorphic Signatures for Subset and Superset Mixed Predicates and Its Applications. doi:10.1007/978-3-031-35486-1_14

doi
[190]

Adaptively Secure Identity-Based Encryption from Middle-Product Learning with Errors

Jingjing Fan and Xingye Lu and Man Ho Au. Adaptively Secure Identity-Based Encryption from Middle-Product Learning with Errors. doi:10.1007/978-3-031-35486-1_15

doi
[191]

Quantum-Access Security of Hash-Based Signature Schemes

Quan Yuan and Mehdi Tibouchi and Masayuki Abe. Quantum-Access Security of Hash-Based Signature Schemes. doi:10.1007/978-3-031-35486-1_16

doi
[192]

Tightly Secure Lattice Identity-Based Signature in the Quantum Random Oracle Model

Ernest Foo and Qinyi Li. Tightly Secure Lattice Identity-Based Signature in the Quantum Random Oracle Model. doi:10.1007/978-3-031-35486-1_17

doi
[193]

Ghidle: Efficient Large-State Block Ciphers for Post-quantum Security

Motoki Nakahashi and Rentaro Shiba and Ravi Anand and Mostafizar Rahman and Kosei Sakamoto and Fukang Liu and Takanori Isobe. Ghidle: Efficient Large-State Block Ciphers for Post-quantum Security. doi:10.1007/978-3-031-35486-1_18

doi
[194]

Quantum Algorithm for Finding Impossible Differentials and Zero-Correlation Linear Hulls of Symmetric Ciphers

Huiqin Chen and Yongqiang Li and Parhat Abla and Zhiran Li and Lin Jiao and Mingsheng Wang. Quantum Algorithm for Finding Impossible Differentials and Zero-Correlation Linear Hulls of Symmetric Ciphers. doi:10.1007/978-3-031-35486-1_19

doi
[195]

Memory-Efficient Quantum Information Set Decoding Algorithm

Naoto Kimura and Atsushi Takayasu and Tsuyoshi Takagi. Memory-Efficient Quantum Information Set Decoding Algorithm. doi:10.1007/978-3-031-35486-1_20

doi
[196]

CSI - SharK : CSI - FiSh with Sharing-friendly Keys

Shahla Atapoor and Karim Baghery and Daniele Cozzo and Robi Pedersen. CSI - SharK : CSI - FiSh with Sharing-friendly Keys. doi:10.1007/978-3-031-35486-1_21

doi
[197]

Practical Verifiable Random Function with RKA Security

Tsz Hon Yuen and Shimin Pan and Sheng Huang and Xiaoting Zhang. Practical Verifiable Random Function with RKA Security. doi:10.1007/978-3-031-35486-1_22

doi
[198]

Statistically Consistent Broadcast Authenticated Encryption with Keyword Search - Adaptive Security from Standard Assumptions

Sayantan Mukherjee. Statistically Consistent Broadcast Authenticated Encryption with Keyword Search - Adaptive Security from Standard Assumptions. doi:10.1007/978-3-031-35486-1_23

doi
[199]

Modular Design of KEM -Based Authenticated Key Exchange

Colin Boyd and Bor de Kock and Lise Millerjord. Modular Design of KEM -Based Authenticated Key Exchange. doi:10.1007/978-3-031-35486-1_24

doi
[200]

Reusable, Instant and Private Payment Guarantees for Cryptocurrencies

Akash Madhusudan and Mahdi Sedaghat and Samarth Tiwari and Kelong Cong and Bart Preneel. Reusable, Instant and Private Payment Guarantees for Cryptocurrencies. doi:10.1007/978-3-031-35486-1_25

doi
[201]

BinAlign : Alignment Padding Based Compiler Provenance Recovery

Maliha Ismail and Yan Lin and DongGyun Han and Debin Gao. BinAlign : Alignment Padding Based Compiler Provenance Recovery. doi:10.1007/978-3-031-35486-1_26

doi
[202]

Encrypted Network Traffic Classification with Higher Order Graph Neural Network

Zulu Okonkwo and Ernest Foo and Zhe Hou and Qinyi Li and Zahra Jadidi. Encrypted Network Traffic Classification with Higher Order Graph Neural Network. doi:10.1007/978-3-031-35486-1_27

doi
[203]

Key Structures: Improved Related-Key Boomerang Attack Against the Full AES -256

Jian Guo and Ling Song and Haoyang Wang. Key Structures: Improved Related-Key Boomerang Attack Against the Full AES -256. doi:10.1007/978-3-031-22301-3_1

doi
[204]

Truncated Differential Properties of the Diagonal Set of Inputs for 5-Round AES

Lorenzo Grassi and Christian Rechberger. Truncated Differential Properties of the Diagonal Set of Inputs for 5-Round AES. doi:10.1007/978-3-031-22301-3_2

doi
[205]

PNB -Focused Differential Cryptanalysis of ChaCha Stream Cipher

Shotaro Miyashita and Ryoma Ito and Atsuko Miyaji. PNB -Focused Differential Cryptanalysis of ChaCha Stream Cipher. doi:10.1007/978-3-031-22301-3_3

doi
[206]

Improved Differential Attack on Round-Reduced LEA

Yuhan Zhang and Wenling Wu and Lei Zhang. Improved Differential Attack on Round-Reduced LEA. doi:10.1007/978-3-031-22301-3_4

doi
[207]

Implementing Grover Oracle for Lightweight Block Ciphers Under Depth Constraints

Subodh Bijwe and Amit Kumar Chauhan and Somitra Kumar Sanadhya. Implementing Grover Oracle for Lightweight Block Ciphers Under Depth Constraints. doi:10.1007/978-3-031-22301-3_5

doi
[208]

Improved Division Property for Ciphers with Complex Linear Layers

Yongxia Mao and Wenling Wu and Bolin Wang and Li Zhang. Improved Division Property for Ciphers with Complex Linear Layers. doi:10.1007/978-3-031-22301-3_6

doi
[209]

Fast Skinny-128 SIMD Implementations for Sequential Modes of Operation

Alexandre Adomnicai and Kazuhiko Minematsu and Maki Shigeri. Fast Skinny-128 SIMD Implementations for Sequential Modes of Operation. doi:10.1007/978-3-031-22301-3_7

doi
[210]

Handle the Traces: Revisiting the Attack on ECDSA with EHNP

Jinzheng Cao and Yanbin Pan and Qingfeng Cheng and Xinghua Li. Handle the Traces: Revisiting the Attack on ECDSA with EHNP. doi:10.1007/978-3-031-22301-3_8

doi
[211]

Hybrid Dual and Meet- LWE Attack

Lei Bi and Xianhui Lu and Junjie Luo and Kunpeng Wang. Hybrid Dual and Meet- LWE Attack. doi:10.1007/978-3-031-22301-3_9

doi
[212]

Cryptanalysis and Repair of a Gabidulin Code Based Cryptosystem from ACISP 2018

Wenshuo Guo and Fangwei Fu. Cryptanalysis and Repair of a Gabidulin Code Based Cryptosystem from ACISP 2018. doi:10.1007/978-3-031-22301-3_10

2018 doi
[213]

Chosen Ciphertext Secure Keyed Two-Level Homomorphic Encryption

Yusaku Maeda and Koji Nuida. Chosen Ciphertext Secure Keyed Two-Level Homomorphic Encryption. doi:10.1007/978-3-031-22301-3_11

doi
[214]

Structure-Preserving Linearly Homomorphic Signature with Designated Combiner for Subspace

Yumei Li and Mingwu Zhang and Futai Zhang. Structure-Preserving Linearly Homomorphic Signature with Designated Combiner for Subspace. doi:10.1007/978-3-031-22301-3_12

doi
[215]

Angelique Faye Loe and Liam Medley and Christian O'Connell and Elizabeth A. Quaglia. TIDE : A Novel Approach to Constructing Timed-Release Encryption. doi:10.1007/978-3-031-22301-3_13

doi
[216]

Multi-signatures for ECDSA and Its Applications in Blockchain

Shimin Pan and Kwan Yin Chan and Handong Cui and Tsz Hon Yuen. Multi-signatures for ECDSA and Its Applications in Blockchain. doi:10.1007/978-3-031-22301-3_14

doi
[217]

Shi Bai and Austin Beard and Floyd Johnson and Sulani K. B. Vidhanalage and Tran Ngo. Fiat-Shamir Signatures Based on Module- NTRU. doi:10.1007/978-3-031-22301-3_15

doi
[218]

Anwar Hasan

Kittiphon Phalakarn and Vorapong Suppakitpaisarn and M. Anwar Hasan. Speeding-Up Parallel Computation of Large Smooth-Degree Isogeny Using Precedence-Constrained Scheduling. doi:10.1007/978-3-031-22301-3_16

doi
[219]

Esgin and Amin Sakzad and Ron Steinfeld

Xiaohui Ding and Muhammed F. Esgin and Amin Sakzad and Ron Steinfeld. An Injectivity Analysis of Crystals - Kyber and Implications on Quantum Security. doi:10.1007/978-3-031-22301-3_17

doi
[220]

R nne and Tjerand Silde

Kristian Gj steen and Thomas Haines and Johannes M \"u ller and Peter B. R nne and Tjerand Silde. Verifiable Decryption in the Head. doi:10.1007/978-3-031-22301-3_18

doi
[221]

Resumable Zero-Knowledge for Circuits from Symmetric Key Primitives

Handong Zhang and Puwen Wei and Haiyang Xue and Yi Deng and Jinsong Li and Wei Wang and Guoxiao Liu. Resumable Zero-Knowledge for Circuits from Symmetric Key Primitives. doi:10.1007/978-3-031-22301-3_19

doi
[222]

On Security of Fuzzy Commitment Scheme for Biometric Authentication

Donghoon Chang and Surabhi Garg and Munawar Hasan and Sweta Mishra. On Security of Fuzzy Commitment Scheme for Biometric Authentication. doi:10.1007/978-3-031-22301-3_20

doi
[223]

SoK : Decentralized Randomness Beacon Protocols

Mayank Raikwar and Danilo Gligoroski. SoK : Decentralized Randomness Beacon Protocols. doi:10.1007/978-3-031-22301-3_21

doi
[224]

CCOM : Cost-Efficient and Collusion-Resistant Oracle Mechanism for Smart Contracts

Xiaofei Wu and Hao Wang and Chunpeng Ge and Lu Zhou and Qiong Huang and Lanju Kong and Lizhen Cui and Zhe Liu. CCOM : Cost-Efficient and Collusion-Resistant Oracle Mechanism for Smart Contracts. doi:10.1007/978-3-031-22301-3_22

doi
[225]

DeChain : A Blockchain Framework Enhancing Decentralization via Sharding

Shenwei Chen and Zhen Liu and Yu Long and Dawu Gu. DeChain : A Blockchain Framework Enhancing Decentralization via Sharding. doi:10.1007/978-3-031-22301-3_23

doi
[226]

Garrison: A Novel Watchtower Scheme for Bitcoin

Arash Mirzaei and Amin Sakzad and Jiangshan Yu and Ron Steinfeld. Garrison: A Novel Watchtower Scheme for Bitcoin. doi:10.1007/978-3-031-22301-3_24

doi
[227]

Shoot Before You Escape: Dynamic Behavior Monitor of Bitcoin Users via Bi-Temporal Network Analytics

Chen Zhao and Jianing Ding and Zhenzhen Li and Zhen Li and Gang Xiong and Gaopeng Gou. Shoot Before You Escape: Dynamic Behavior Monitor of Bitcoin Users via Bi-Temporal Network Analytics. doi:10.1007/978-3-031-22301-3_25

doi
[228]

Leakage Resilient Cheating Detectable Secret Sharing Schemes

Sabyasachi Dutta and Reihaneh Safavi-Naini. Leakage Resilient Cheating Detectable Secret Sharing Schemes. doi:10.1007/978-3-030-90567-5_1

doi
[229]

Chosen Ciphertext Secure Functional Encryption from Constrained Witness PRF

Tapas Pal and Ratna Dutta. Chosen Ciphertext Secure Functional Encryption from Constrained Witness PRF. doi:10.1007/978-3-030-90567-5_2

doi
[230]

Updatable Trapdoor SPHFs : Modular Construction of Updatable Zero-Knowledge Arguments and More

Behzad Abdolmaleki and Daniel Slamanig. Updatable Trapdoor SPHFs : Modular Construction of Updatable Zero-Knowledge Arguments and More. doi:10.1007/978-3-030-90567-5_3

doi
[231]

Galbraith and Trey Li

Steven D. Galbraith and Trey Li. Small Superset and Big Subset Obfuscation. doi:10.1007/978-3-030-90567-5_4

doi
[232]

Algebraic Attacks on Round-Reduced Keccak

Fukang Liu and Takanori Isobe and Willi Meier and Zhonghao Yang. Algebraic Attacks on Round-Reduced Keccak. doi:10.1007/978-3-030-90567-5_5

doi
[233]

Muhammad ElSheikh and Amr M. Youssef. On MILP -Based Automatic Search for Bit-Based Division Property for Ciphers with (Large) Linear Layers. doi:10.1007/978-3-030-90567-5_6

doi
[234]

Constructions of Iterative Near- MDS Matrices with the Lowest XOR Count

Xiaodan Li and Wenling Wu. Constructions of Iterative Near- MDS Matrices with the Lowest XOR Count. doi:10.1007/978-3-030-90567-5_7

doi
[235]

Forced Independent Optimized Implementation of 4-Bit S -Box

Yanhong Fan and Weijia Wang and Zhihu Li and Zhenyu Lu and Siu-Ming Yiu and Meiqin Wang. Forced Independent Optimized Implementation of 4-Bit S -Box. doi:10.1007/978-3-030-90567-5_8

doi
[236]

Distinguishing and Key Recovery Attacks on the Reduced-Round SNOW - V

Jin Hoki and Takanori Isobe and Ryoma Ito and Fukang Liu and Kosei Sakamoto. Distinguishing and Key Recovery Attacks on the Reduced-Round SNOW - V. doi:10.1007/978-3-030-90567-5_9

doi
[237]

Broadcast Authenticated Encryption with Keyword Search

Xueqiao Liu and Kai He and Guomin Yang and Willy Susilo and Joseph Tonien and Qiong Huang. Broadcast Authenticated Encryption with Keyword Search. doi:10.1007/978-3-030-90567-5_10

doi
[238]

An Anonymous Trace-and-Revoke Broadcast Encryption Scheme

Olivier Blazy and Sayantan Mukherjee and Huyen Nguyen and Duong Hieu Phan and Damien Stehl \'e. An Anonymous Trace-and-Revoke Broadcast Encryption Scheme. doi:10.1007/978-3-030-90567-5_11

doi
[239]

Security Analysis of End-to-End Encryption for Zoom Meetings

Takanori Isobe and Ryoma Ito. Security Analysis of End-to-End Encryption for Zoom Meetings. doi:10.1007/978-3-030-90567-5_12

doi
[240]

CCA Secure Attribute-Hiding Inner Product Encryption from Minimal Assumption

Tapas Pal and Ratna Dutta. CCA Secure Attribute-Hiding Inner Product Encryption from Minimal Assumption. doi:10.1007/978-3-030-90567-5_13

doi
[241]

Optimal Randomized Partial Checking for Decryption Mix Nets

Thomas Haines and Johannes M \"u ller. Optimal Randomized Partial Checking for Decryption Mix Nets. doi:10.1007/978-3-030-90567-5_14

doi
[242]

A Novel Proof of Shuffle: Exponentially Secure Cut-and-Choose

Thomas Haines and Johannes M \"u ller. A Novel Proof of Shuffle: Exponentially Secure Cut-and-Choose. doi:10.1007/978-3-030-90567-5_15

doi
[243]

Private Decision Tree Evaluation with Constant Rounds via (Only) Fair SS - 4PC

Hikaru Tsuchida and Takashi Nishide. Private Decision Tree Evaluation with Constant Rounds via (Only) Fair SS - 4PC. doi:10.1007/978-3-030-90567-5_16

doi
[244]

Geoffroy Couteau and A. W. Roscoe and Peter Y. A. Ryan. Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer. doi:10.1007/978-3-030-90567-5_17

doi
[245]

Concise Mercurial Subvector Commitments: Definitions and Constructions

Yannan Li and Willy Susilo and Guomin Yang and Tran Viet Xuan Phuong and Yong Yu and Dongxi Liu. Concise Mercurial Subvector Commitments: Definitions and Constructions. doi:10.1007/978-3-030-90567-5_18

doi
[246]

A Secure Cross-Shard View-Change Protocol for Sharding Blockchains

Yizhong Liu and Jianwei Liu and Yiming Hei and Yu Xia and Qianhong Wu. A Secure Cross-Shard View-Change Protocol for Sharding Blockchains. doi:10.1007/978-3-030-90567-5_19

doi
[247]

Efficient Unique Ring Signature for Blockchain Privacy Protection

Anh The Ta and Thanh Xuan Khuc and Tuong Ngoc Nguyen and Huy Quoc Le and Dung Hoang Duong and Willy Susilo and Kazuhide Fukushima and Shinsaku Kiyomoto. Efficient Unique Ring Signature for Blockchain Privacy Protection. doi:10.1007/978-3-030-90567-5_20

doi
[248]

Redactable Transactions in Consortium Blockchain: Controlled by Multi-authority CP - ABE

Zongyang Zhang and Tong Li and Zhuo Wang and Jianwei Liu. Redactable Transactions in Consortium Blockchain: Controlled by Multi-authority CP - ABE. doi:10.1007/978-3-030-90567-5_21

doi
[249]

Liu and Ron Steinfeld and Dongxi Liu

Dimaz Ankaa Wijaya and Joseph K. Liu and Ron Steinfeld and Dongxi Liu. Transparency or Anonymity Leak: Monero Mining Pools Data Publication. doi:10.1007/978-3-030-90567-5_22

doi
[250]

Mind the Scraps: Attacking Blockchain Based on Selfdestruct

Wei-Yang Chiu and Weizhi Meng. Mind the Scraps: Attacking Blockchain Based on Selfdestruct. doi:10.1007/978-3-030-90567-5_23

doi
[251]

A Blockchain-Enabled Federated Learning Model for Privacy Preservation: System Design

Minfeng Qi and Ziyuan Wang and Fan Wu and Rob Hanson and Shiping Chen and Yang Xiang and Liming Zhu. A Blockchain-Enabled Federated Learning Model for Privacy Preservation: System Design. doi:10.1007/978-3-030-90567-5_24

doi
[252]

ALRS : An Adversarial Noise Based Privacy-Preserving Data Sharing Mechanism

Jikun Chen and Ruoyu Deng and Hongbin Chen and Na Ruan and Yao Liu and Chao Liu and Chunhua Su. ALRS : An Adversarial Noise Based Privacy-Preserving Data Sharing Mechanism. doi:10.1007/978-3-030-90567-5_25

doi
[253]

Non-interactive, Secure Verifiable Aggregation for Decentralized, Privacy-Preserving Learning

Carlo Brunetta and Georgia Tsaloli and Bei Liang and Gustavo Banegas and Aikaterini Mitrokotsa. Non-interactive, Secure Verifiable Aggregation for Decentralized, Privacy-Preserving Learning. doi:10.1007/978-3-030-90567-5_26

doi
[254]

Towards Visualizing and Detecting Audio Adversarial Examples for Automatic Speech Recognition

Wei Zong and Yang-Wai Chow and Willy Susilo. Towards Visualizing and Detecting Audio Adversarial Examples for Automatic Speech Recognition. doi:10.1007/978-3-030-90567-5_27

doi
[255]

Oriole: Thwarting Privacy Against Trustworthy Deep Learning Models

Liuqiao Chen and Hu Wang and Benjamin Zi Hao Zhao and Minhui Xue and Haifeng Qian. Oriole: Thwarting Privacy Against Trustworthy Deep Learning Models. doi:10.1007/978-3-030-90567-5_28

doi
[256]

Puncturable Identity-Based Encryption from Lattices

Priyanka Dutta and Willy Susilo and Dung Hoang Duong and Partha Sarathi Roy. Puncturable Identity-Based Encryption from Lattices. doi:10.1007/978-3-030-90567-5_29

doi
[257]

Optimizing Bootstrapping and Evaluating Large FHE Gates in the LWE -Based GSW - FHE

Chao Liu and Anyu Wang and Zhongxiang Zheng. Optimizing Bootstrapping and Evaluating Large FHE Gates in the LWE -Based GSW - FHE. doi:10.1007/978-3-030-90567-5_30

doi
[258]

Forward-Secure Group Encryptions from Lattices

Jing Pan and Xiaofeng Chen and Fangguo Zhang and Willy Susilo. Forward-Secure Group Encryptions from Lattices. doi:10.1007/978-3-030-90567-5_31

doi
[259]

Anonymous Lattice Identity-Based Encryption with Traceable Identities

Xavier Boyen and Ernest Foo and Qinyi Li. Anonymous Lattice Identity-Based Encryption with Traceable Identities. doi:10.1007/978-3-030-90567-5_32

doi
[260]

Lattice-Based Secure Biometric Authentication for Hamming Distance

Jung Hee Cheon and Dongwoo Kim and Duhyeong Kim and Joohee Lee and Junbum Shin and Yongsoo Song. Lattice-Based Secure Biometric Authentication for Hamming Distance. doi:10.1007/978-3-030-90567-5_33

doi
[261]

A Trustless GQ Multi-signature Scheme with Identifiable Abort

Handong Cui and Tsz Hon Yuen. A Trustless GQ Multi-signature Scheme with Identifiable Abort. doi:10.1007/978-3-030-90567-5_34

doi
[262]

Aaron Gulliver

Mahmoud Yehia and Riham AlTawy and T. Aaron Gulliver. Verifiable Obtained Random Subsets for Improving SPHINCS ^+. doi:10.1007/978-3-030-90567-5_35

doi
[263]

Lattice Blind Signatures with Forward Security

Huy Quoc Le and Dung Hoang Duong and Willy Susilo and Ha Thanh Nguyen Tran and Viet Cuong Trinh and Josef Pieprzyk and Thomas Plantard. Lattice Blind Signatures with Forward Security. doi:10.1007/978-3-030-55304-3_1

doi
[264]

Optimized Arithmetic Operations for Isogeny-Based Cryptography on Huff Curves

Yan Huang and Fangguo Zhang and Zhi Hu and Zhijie Liu. Optimized Arithmetic Operations for Isogeny-Based Cryptography on Huff Curves. doi:10.1007/978-3-030-55304-3_2

doi
[265]

On Lattice-Based Interactive Protocols: An Approach with Less or No Aborts

Nabil Alkeilani Alkadri and Rachid El Bansarkhani and Johannes Buchmann. On Lattice-Based Interactive Protocols: An Approach with Less or No Aborts. doi:10.1007/978-3-030-55304-3_3

doi
[266]

SKCN : Practical and Flexible Digital Signature from Module Lattice

Boru Gong and Leixiao Cheng and Yunlei Zhao. SKCN : Practical and Flexible Digital Signature from Module Lattice. doi:10.1007/978-3-030-55304-3_4

doi
[267]

Davies and Herman Galteland and Kristian Gj steen and Yao Jiang

Gareth T. Davies and Herman Galteland and Kristian Gj steen and Yao Jiang. Cloud-Assisted Asynchronous Key Transport with Post-Quantum Security. doi:10.1007/978-3-030-55304-3_5

doi
[268]

Rotational- XOR Cryptanalysis of Simon-Like Block Ciphers

Jinyu Lu and Yunwen Liu and Tomer Ashur and Bing Sun and Chao Li. Rotational- XOR Cryptanalysis of Simon-Like Block Ciphers. doi:10.1007/978-3-030-55304-3_6

doi
[269]

A New Improved AES S -box with Enhanced Properties

Abderrahmane Nitaj and Willy Susilo and Joseph Tonien. A New Improved AES S -box with Enhanced Properties. doi:10.1007/978-3-030-55304-3_7

doi
[270]

Galaxy: A Family of Stream-Cipher-Based Space-Hard Ciphers

Yuji Koike and Kosei Sakamoto and Takuya Hayashi and Takanori Isobe. Galaxy: A Family of Stream-Cipher-Based Space-Hard Ciphers. doi:10.1007/978-3-030-55304-3_8

doi
[271]

Automated Search for Block Cipher Differentials: A GPU -Accelerated Branch-and-Bound Algorithm

Wei-Zhu Yeoh and Je Sen Teh and Jiageng Chen. Automated Search for Block Cipher Differentials: A GPU -Accelerated Branch-and-Bound Algorithm. doi:10.1007/978-3-030-55304-3_9

doi
[272]

Kabaleeshwaran

Sanjit Chatterjee and R. Kabaleeshwaran. From Rerandomizability to Sequential Aggregation: Efficient Signature Schemes Based on SXDH Assumption. doi:10.1007/978-3-030-55304-3_10

doi
[273]

Parallel Implementation of SM2 Elliptic Curve Cryptography on Intel Processors with AVX2

Junhao Huang and Zhe Liu and Zhi Hu and Johann Gro sch \"a dl. Parallel Implementation of SM2 Elliptic Curve Cryptography on Intel Processors with AVX2. doi:10.1007/978-3-030-55304-3_11

doi
[274]

Improved Security Proof for the Camenisch - Lysyanskaya Signature-Based Synchronized Aggregate Signature Scheme

Masayuki Tezuka and Keisuke Tanaka. Improved Security Proof for the Camenisch - Lysyanskaya Signature-Based Synchronized Aggregate Signature Scheme. doi:10.1007/978-3-030-55304-3_12

doi
[275]

DCONST : Detection of Multiple-Mix-Attack Malicious Nodes Using Consensus-Based Trust in IoT Networks

Zuchao Ma and Liang Liu and Weizhi Meng. DCONST : Detection of Multiple-Mix-Attack Malicious Nodes Using Consensus-Based Trust in IoT Networks. doi:10.1007/978-3-030-55304-3_13

doi
[276]

A Black-Box Attack on Neural Networks Based on Swarm Evolutionary Algorithm

Xiaolei Liu and Teng Hu and Kangyi Ding and Yang Bai and Weina Niu and Jiazhong Lu. A Black-Box Attack on Neural Networks Based on Swarm Evolutionary Algorithm. doi:10.1007/978-3-030-55304-3_14

doi
[277]

A Blockchain-Based Resource Supervision Scheme for Edge Devices Under Cloud-Fog-End Computing Models

Tongchen Wang and Jianwei Liu and Dawei Li and Qianhong Wu. A Blockchain-Based Resource Supervision Scheme for Edge Devices Under Cloud-Fog-End Computing Models. doi:10.1007/978-3-030-55304-3_15

doi
[278]

SHOSVD : Secure Outsourcing of High-Order Singular Value Decomposition

Jinrong Chen and Lin Liu and Rongmao Chen and Wei Peng. SHOSVD : Secure Outsourcing of High-Order Singular Value Decomposition. doi:10.1007/978-3-030-55304-3_16

doi
[279]

Efficient Forward-Secure Threshold Public Key Encryption

Rafael Kurek. Efficient Forward-Secure Threshold Public Key Encryption. doi:10.1007/978-3-030-55304-3_17

doi
[280]

A New Targeted Password Guessing Model

Zhijie Xie and Min Zhang and Anqi Yin and Zhenhan Li. A New Targeted Password Guessing Model. doi:10.1007/978-3-030-55304-3_18

doi
[281]

Multi-input Laconic Function Evaluation

Bo Pang and Long Chen and Xiong Fan and Qiang Tang. Multi-input Laconic Function Evaluation. doi:10.1007/978-3-030-55304-3_19

doi
[282]

Arbitrary-Centered Discrete Gaussian Sampling over the Integers

Yusong Du and Baoying Fan and Baodian Wei. Arbitrary-Centered Discrete Gaussian Sampling over the Integers. doi:10.1007/978-3-030-55304-3_20

doi
[283]

New Assumptions and Efficient Cryptosystems from the e-th Power Residue Symbol

Xiaopeng Zhao and Zhenfu Cao and Xiaolei Dong and Jun Shao and Licheng Wang and Zhusen Liu. New Assumptions and Efficient Cryptosystems from the e-th Power Residue Symbol. doi:10.1007/978-3-030-55304-3_21

doi
[284]

Revisiting the Hardness of Binary Error LWE

Chao Sun and Mehdi Tibouchi and Masayuki Abe. Revisiting the Hardness of Binary Error LWE. doi:10.1007/978-3-030-55304-3_22

doi
[285]

PALOR : Poisoning Attacks Against Logistic Regression

Jialin Wen and Benjamin Zi Hao Zhao and Minhui Xue and Haifeng Qian. PALOR : Poisoning Attacks Against Logistic Regression. doi:10.1007/978-3-030-55304-3_23

doi
[286]

DeepCapture : Image Spam Detection Using Deep Learning and Data Augmentation

Bedeuro Kim and Sharif Abuadbba and Hyoungshick Kim. DeepCapture : Image Spam Detection Using Deep Learning and Data Augmentation. doi:10.1007/978-3-030-55304-3_24

doi
[287]

Rolling Attack: An Efficient Way to Reduce Armors of Office Automation Devices

Linyu Li and Lei Yu and Can Yang and Jie Gou and Jiawei Yin and Xiaorui Gong. Rolling Attack: An Efficient Way to Reduce Armors of Office Automation Devices. doi:10.1007/978-3-030-55304-3_25

doi
[288]

Improving Key Mismatch Attack on NewHope with Fewer Queries

Satoshi Okada and Yuntao Wang and Tsuyoshi Takagi. Improving Key Mismatch Attack on NewHope with Fewer Queries. doi:10.1007/978-3-030-55304-3_26

doi
[289]

Anubhab Baksi and Vinay B. Y. Kumar and Banashri Karmakar and Shivam Bhasin and Dhiman Saha and Anupam Chattopadhyay. A Novel Duplication Based Countermeasure to Statistical Ineffective Fault Analysis. doi:10.1007/978-3-030-55304-3_27

doi
[290]

Woo and Hyoungshick Kim

Hanbin Jang and Woojoong Ji and Simon S. Woo and Hyoungshick Kim. Design and Evaluation of Enumeration Attacks on Package Tracking Systems. doi:10.1007/978-3-030-55304-3_28

doi
[291]

JTaint : Finding Privacy-Leakage in Chrome Extensions

Mengfei Xie and Jianming Fu and Jia He and Chenke Luo and Guojun Peng. JTaint : Finding Privacy-Leakage in Chrome Extensions. doi:10.1007/978-3-030-55304-3_29

doi
[292]

Unlinkable Updatable Databases and Oblivious Transfer with Access Control

Aditya Damodaran and Alfredo Rial. Unlinkable Updatable Databases and Oblivious Transfer with Access Control. doi:10.1007/978-3-030-55304-3_30

doi
[293]

Secure and Compact Elliptic Curve LR Scalar Multiplication

Yaoan Jin and Atsuko Miyaji. Secure and Compact Elliptic Curve LR Scalar Multiplication. doi:10.1007/978-3-030-55304-3_31

doi
[294]

User Identity Linkage Across Social Networks via Community Preserving Network Embedding

Xiaoyu Guo and Yan Liu and Lian Liu and Guangsheng Zhang and Jing Chen and Yuan Zhao. User Identity Linkage Across Social Networks via Community Preserving Network Embedding. doi:10.1007/978-3-030-55304-3_32

doi
[295]

Improvement of Attribute-Based Encryption Using Blakley Secret Sharing

Zhe Xia and Bo Yang and Yanwei Zhou and Mingwu Zhang and Yi Mu. Improvement of Attribute-Based Encryption Using Blakley Secret Sharing. doi:10.1007/978-3-030-55304-3_33

doi
[296]

Recovering CRT - RSA Secret Keys from Noisy Square-and-Multiply Sequences in the Sliding Window Method

Kento Oonishi and Noboru Kunihiro. Recovering CRT - RSA Secret Keys from Noisy Square-and-Multiply Sequences in the Sliding Window Method. doi:10.1007/978-3-030-55304-3_34

doi
[297]

Security Analysis on Tangle-Based Blockchain Through Simulation

Bozhi Wang and Qin Wang and Shiping Chen and Yang Xiang. Security Analysis on Tangle-Based Blockchain Through Simulation. doi:10.1007/978-3-030-55304-3_35

doi
[298]

Tightly Secure Chameleon Hash Functions in the Multi-user Setting and Their Applications

Xiangyu Liu and Shengli Liu and Dawu Gu. Tightly Secure Chameleon Hash Functions in the Multi-user Setting and Their Applications. doi:10.1007/978-3-030-55304-3_36

doi
[299]

Ciphertext-Delegatable CP - ABE for a Dynamic Credential: A Modular Approach

Jongkil Kim and Willy Susilo and Joonsang Baek and Surya Nepal and Dongxi Liu. Ciphertext-Delegatable CP - ABE for a Dynamic Credential: A Modular Approach. doi:10.1007/978-3-030-21548-4_1

doi
[300]

Location Based Encryption

Tran Viet Xuan Phuong and Willy Susilo and Guomin Yang and Jun Yan and Dongxi Liu. Location Based Encryption. doi:10.1007/978-3-030-21548-4_2

doi

Pith tools

Reviewed July 12, 2026 · model on record in the stance chip above.

[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=

arXiv

[3] [3]

arXiv preprint arXiv:2506.13609 , year=

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

arXiv

[4] [4]

arXiv preprint arXiv:2505.03989 , year=

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

arXiv

[5] [5]

arXiv preprint arXiv:1810.08575 , year=

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

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=

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=

arXiv