cover_image

【論文速遞】Crypto 2025(證明、承諾、簽名、區塊鏈、量子、格、偽隨機、混淆)

Kurt Pan XPTY
2025年08月17日 17:12

https://crypto.iacr.org/2025/program.php

August 17-21, 2025

  • Best Paper
    • Compact Lattice Signatures via Iterative Rejection Sampling
    • KLPT²: Algebraic Pathfinding in Dimension Two and Applications
    • On One-Shot Signatures, Quantum vs Classical Binding, and Obfuscating Permutations
  • Proof Systems
    • Arc: Accumulation for Reed--Solomon Codes
    • Breaking Verifiable Delay Functions in the Random Oracle Model
    • On Deniable Authentication against Malicious Verifiers
    • Straight-Line Knowledge Extraction for Multi-Round Protocols
    • Designated-Verifier SNARGs with One Group Element
    • Universally Composable SNARKs with Transparent Setup without Programmable Random Oracle
    • A Pure Indistinguishability Obfuscation Approach to Adaptively-Sound SNARGs for NP
    • Incrementally Verifiable Computation for NP from Standard Assumptions
    • LatticeFold+: Faster, Simpler, Shorter Lattice-Based Folding for Succinct Proof Systems
    • On Knowledge-Soundness of Plonk in ROM from Falsifiable Assumptions
    • Malicious Security in Collaborative zk-SNARKs: More than Meets the Eye
  • Functional & Polynomial Commitments
    • Polynomial Commitments for Galois Rings and Applications to SNARKs over 
    • DewTwo: a transparent PCS with quasi-linear prover, logarithmic verifier and 4.5KB proofs from falsifiable assumptions
    • On Extractability of the KZG Family of Polynomial Commitment Schemes
  • Fiat-Shamir
    • How to Prove False Statements: Practical Attacks on Fiat-Shamir
    • Towards a White-Box Secure Fiat-Shamir Transformation
    • Exclusive Ownership of Fiat-Shamir Signatures: ML-DSA, SQIsign, LESS, and More
    • A Complete Security Proof of SQIsign
  • Signatures
    • At the Top of the Hypercube -- Better Size-Time Tradeoffs for Hash-Based Signatures
    • Blind Signatures from Proofs of Inequality
    • Improved Attacks for SNOVA by Exploiting Stability under a Group Action
    • Adaptively Secure Three-Round Threshold Schnorr Signatures from DDH
    • Unmasking TRaccoon: A Lattice-Based Threshold Signature with An Efficient Identifiable Abort Protocol
    • A Plausible Attack on the Adaptive Security of Threshold Schnorr Signatures
    • On the Adaptive Security of FROST
    • Schnorr Signatures are Tightly Secure in the ROM under a Non-interactive Assumption
    • T-Spoon: Tightly Secure Two-Round Multi-Signatures with Key Aggregation
    • Server-Aided Anonymous Credentials
    • Multi-Holder Anonymous Credentials from BBS Signatures
  • Consensus & Blockchain
    • Foundations of Platform-Assisted Auctions
    • Merkle Mountain Ranges are Optimal: On Witness Update Frequency for Cryptographic Accumulators
    • State Machine Replication Among Strangers, Fast and Self-Sufficient
    • Leader Election with Poly-logarithmic Communication Per Party
    • High-Throughput Permissionless Blockchain Consensus under Realistic Network Assumptions
    • Nearly Optimal Parallel Broadcast in the Plain Public Key Model
  • Lattice-based Cryptography
    • Wagner's Algorithm Provably Runs in Subexponential Time for SIS
    • Refined Attack on LWE with Hints: Constructing Lattice via Gaussian Elimination
    • Uncompressing Dilithium's public key
  • Quantum Cryptography
    • How to Model Unitary Oracles
    • Translating Between the Common Haar Random State Model and the Unitary Model
    • Pseudorandom Unitaries in the Haar Random Oracle Model
    • Succinct Arguments for BatchQMA and Friends under 8 rounds
    • Reducing the Number of Qubits in Quantum Factoring
    • A Quasi-polynomial Time Algorithm for the Extrapolated Dihedral Coset Problem over Power-of-Two Moduli
    • Quantum State Group Actions
    • Quantum Lifting for Invertible Permutations and Ideal Ciphers
    • LWE with Quantum Amplitudes: Algorithm, Hardness, and Oblivious Sampling
    • Quantum Cryptography from Meta-Complexity
    • On the Power of Oblivious State Preparation
    • Compiled Nonlocal Games from any Trapdoor Claw-Free Function
    • Quantum One-Time Protection of any Randomized Algorithm
  • Complexity‑Theoretic Foundations & Pseudorandomness
    • Uniform Black-Box Separations via Non-Malleable Extractors
    • Hardness Along the Boundary: Towards One-Way Functions from the Worst-case Hardness of Time-Bounded Kolmogorov Complexity
    • Pseudorandomness Properties of Random Reversible Circuits
    • Efficient randomized strong 2-source non-malleable extractor for any linear min-entropy
  • Pseudorandom Functions
    • A Fully-Adaptive Threshold Partially-Oblivious PRF
    • Adaptive Security for Constrained PRFs
    • Succinct PPRFs via Memory-Tight Reductions
    • Traceable Verifiable Random Functions
  • Obfuscation
    • Lattice-Based Post-Quantum iO from Circular Security with Random Opening Assumption (Part II: zeroizing attacks against private-coin evasive LWE assumptions)
    • Lattice-based Obfuscation from NTRU and Equivocal LWE
    • Pseudorandom Obfuscation and Applications
    • Simple and General Counterexamples for Private-Coin Evasive LWE

Best Paper

Compact Lattice Signatures via Iterative Rejection Sampling

@misc{cryptoeprint:2024/2052,
      author = {Joel Gärtner},
      title = {Compact Lattice Signatures via Iterative Rejection Sampling},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/2052},
      year = {2024},
      url = {https://eprint.iacr.org/2024/2052}
}

KLPT²: Algebraic Pathfinding in Dimension Two and Applications

@misc{cryptoeprint:2025/372,
      author = {Wouter Castryck and Thomas Decru and Péter Kutas and Abel Laval and Christophe Petit and Yan Bo Ti},
      title = {{KLPT²}: Algebraic Pathfinding in Dimension Two and Applications},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/372},
      year = {2025},
      url = {https://eprint.iacr.org/2025/372}
}

On One-Shot Signatures, Quantum vs Classical Binding, and Obfuscating Permutations

@misc{cryptoeprint:2025/486,
      author = {Omri Shmueli and Mark Zhandry},
      title = {On One-Shot Signatures, Quantum vs Classical Binding, and Obfuscating Permutations},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/486},
      year = {2025},
      url = {https://eprint.iacr.org/2025/486}
}

Proof Systems

Arc: Accumulation for Reed–Solomon Codes

@misc{cryptoeprint:2024/1731,
      author = {Benedikt Bünz and Pratyush Mishra and Wilson Nguyen and William Wang},
      title = {Arc: Accumulation for Reed--Solomon Codes},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/1731},
      year = {2024},
      url = {https://eprint.iacr.org/2024/1731}
}

Breaking Verifiable Delay Functions in the Random Oracle Model

@misc{cryptoeprint:2024/766,
      author = {Ziyi Guan and Artur Riazanov and Weiqiang Yuan},
      title = {Breaking Verifiable Delay Functions in the Random Oracle Model},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/766},
      year = {2024},
      url = {https://eprint.iacr.org/2024/766}
}

On Deniable Authentication against Malicious Verifiers

@misc{cryptoeprint:2025/470,
      author = {Rune Fiedler and Roman Langrehr},
      title = {On Deniable Authentication against Malicious Verifiers},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/470},
      year = {2025},
      url = {https://eprint.iacr.org/2025/470}
}

Straight-Line Knowledge Extraction for Multi-Round Protocols

@misc{cryptoeprint:2024/1724,
      author = {Lior Rotem and Stefano Tessaro},
      title = {Straight-Line Knowledge Extraction for Multi-Round Protocols},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/1724},
      year = {2024},
      url = {https://eprint.iacr.org/2024/1724}
}

Designated-Verifier SNARGs with One Group Element

@misc{cryptoeprint:2025/517,
      author = {Gal Arnon and Jesko Dujmovic and Yuval Ishai},
      title = {Designated-Verifier {SNARGs} with One Group Element},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/517},
      year = {2025},
      url = {https://eprint.iacr.org/2025/517}
}

Universally Composable SNARKs with Transparent Setup without Programmable Random Oracle

@misc{cryptoeprint:2024/1549,
      author = {Christian Badertscher and Matteo Campanelli and Michele Ciampi and Luigi Russo and Luisa Siniscalchi},
      title = {Universally Composable {SNARKs} with Transparent Setup without Programmable Random Oracle},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/1549},
      year = {2024},
      url = {https://eprint.iacr.org/2024/1549}
}

A Pure Indistinguishability Obfuscation Approach to Adaptively-Sound SNARGs for NP

@misc{cryptoeprint:2024/933,
      author = {Brent Waters and David J. Wu},
      title = {A Pure Indistinguishability Obfuscation Approach to Adaptively-Sound {SNARGs} for {NP}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/933},
      year = {2024},
      url = {https://eprint.iacr.org/2024/933}
}

Incrementally Verifiable Computation for NP from Standard Assumptions

Pratish Datta, Abhishek Jain, Zhengzhong Jin, Alexis Korb, Surya Mathialagan, Amit Sahai

LatticeFold+: Faster, Simpler, Shorter Lattice-Based Folding for Succinct Proof Systems

@misc{cryptoeprint:2025/247,
      author = {Dan Boneh and Binyi Chen},
      title = {{LatticeFold}+: Faster, Simpler, Shorter Lattice-Based Folding for Succinct Proof Systems},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/247},
      year = {2025},
      url = {https://eprint.iacr.org/2025/247}
}

On Knowledge-Soundness of Plonk in ROM from Falsifiable Assumptions

@misc{cryptoeprint:2024/994,
      author = {Helger Lipmaa and Roberto Parisella and Janno Siim},
      title = {On Knowledge-Soundness of Plonk in {ROM} from Falsifiable Assumptions},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/994},
      year = {2024},
      url = {https://eprint.iacr.org/2024/994}
}

Malicious Security in Collaborative zk-SNARKs: More than Meets the Eye

@misc{cryptoeprint:2025/1026,
      author = {Sanjam Garg and Aarushi Goel and Abhishek Jain and Bhaskar Roberts and Sruthi Sekar},
      title = {Malicious Security in Collaborative zk-{SNARKs}: More than Meets the Eye},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/1026},
      year = {2025},
      url = {https://eprint.iacr.org/2025/1026}
}

Functional & Polynomial Commitments

Polynomial Commitments for Galois Rings and Applications to SNARKs over Z_2^k

Yuhao Jia, Songsong Li, Chaoping Xing, Yizhou Yao, Chen Yuan

DewTwo: a transparent PCS with quasi-linear prover, logarithmic verifier and 4.5KB proofs from falsifiable assumptions

@misc{cryptoeprint:2025/129,
      author = {Benedikt Bünz and Tushar Mopuri and Alireza Shirzad and Sriram Sridhar},
      title = {{DewTwo}: a transparent {PCS} with quasi-linear prover, logarithmic verifier and 4.{5KB} proofs from falsifiable assumptions},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/129},
      year = {2025},
      url = {https://eprint.iacr.org/2025/129}
}

On Extractability of the KZG Family of Polynomial Commitment Schemes

@misc{cryptoeprint:2025/514,
      author = {Juraj Belohorec and Pavel Dvořák and Charlotte Hoffmann and Pavel Hubáček and Kristýna Mašková and Martin Pastyřík},
      title = {On Extractability of the {KZG} Family of Polynomial Commitment Schemes},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/514},
      year = {2025},
      url = {https://eprint.iacr.org/2025/514}
}

Fiat-Shamir

How to Prove False Statements: Practical Attacks on Fiat-Shamir

@misc{cryptoeprint:2025/118,
      author = {Dmitry Khovratovich and Ron D. Rothblum and Lev Soukhanov},
      title = {How to Prove False Statements: Practical Attacks on Fiat-Shamir},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/118},
      year = {2025},
      url = {https://eprint.iacr.org/2025/118}
}

Towards a White-Box Secure Fiat-Shamir Transformation

@misc{cryptoeprint:2025/329,
      author = {Gal Arnon and Eylon Yogev},
      title = {Towards a White-Box Secure Fiat-Shamir Transformation},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/329},
      year = {2025},
      url = {https://eprint.iacr.org/2025/329}
}

Exclusive Ownership of Fiat-Shamir Signatures: ML-DSA, SQIsign, LESS, and More

@misc{cryptoeprint:2025/900,
      author = {Michael Meyer and Patrick Struck and Maximiliane Weishäupl},
      title = {Exclusive Ownership of Fiat-Shamir Signatures: {ML}-{DSA}, {SQIsign}, {LESS}, and More},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/900},
      year = {2025},
      url = {https://eprint.iacr.org/2025/900}
}

A Complete Security Proof of SQIsign

@misc{cryptoeprint:2025/379,
      author = {Marius A. Aardal and Andrea Basso and Luca De Feo and Sikhar Patranabis and Benjamin Wesolowski},
      title = {A Complete Security Proof of {SQIsign}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/379},
      year = {2025},
      url = {https://eprint.iacr.org/2025/379}
}

Signatures

At the Top of the Hypercube – Better Size-Time Tradeoffs for Hash-Based Signatures

@misc{cryptoeprint:2025/889,
      author = {Dmitry Khovratovich and Mikhail Kudinov and Benedikt Wagner},
      title = {At the Top of the Hypercube -- Better Size-Time Tradeoffs for Hash-Based Signatures},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/889},
      year = {2025},
      url = {https://eprint.iacr.org/2025/889}
}

Blind Signatures from Proofs of Inequality

@misc{cryptoeprint:2024/2076,
      author = {Michael Klooß and Michael Reichle},
      title = {Blind Signatures from Proofs of Inequality},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/2076},
      year = {2024},
      url = {https://eprint.iacr.org/2024/2076}
}

Improved Attacks for SNOVA by Exploiting Stability under a Group Action

@misc{cryptoeprint:2024/1770,
      author = {Daniel Cabarcas and Peigen Li and Javier Verbel and Ricardo Villanueva-Polanco},
      title = {Improved Attacks for {SNOVA} by Exploiting Stability under a Group Action},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/1770},
      year = {2024},
      url = {https://eprint.iacr.org/2024/1770}
}

Adaptively Secure Three-Round Threshold Schnorr Signatures from DDH

@misc{cryptoeprint:2025/1009,
      author = {Renas Bacho and Sourav Das and Julian Loss and Ling Ren},
      title = {Adaptively Secure Three-Round Threshold Schnorr Signatures from {DDH}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/1009},
      year = {2025},
      url = {https://eprint.iacr.org/2025/1009}
}

Unmasking TRaccoon: A Lattice-Based Threshold Signature with An Efficient Identifiable Abort Protocol

@misc{cryptoeprint:2025/849,
      author = {Rafael del Pino and Shuichi Katsumata and Guilhem Niot and Michael Reichle and Kaoru Takemure},
      title = {Unmasking {TRaccoon}: A Lattice-Based Threshold Signature with An Efficient Identifiable Abort Protocol},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/849},
      year = {2025},
      url = {https://eprint.iacr.org/2025/849}
}

A Plausible Attack on the Adaptive Security of Threshold Schnorr Signatures

@misc{cryptoeprint:2025/1001,
      author = {Elizabeth Crites and Alistair Stewart},
      title = {A Plausible Attack on the Adaptive Security of Threshold Schnorr Signatures},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/1001},
      year = {2025},
      url = {https://eprint.iacr.org/2025/1001}
}

On the Adaptive Security of FROST

@misc{cryptoeprint:2025/1061,
      author = {Elizabeth Crites and Jonathan Katz and Chelsea Komlo and Stefano Tessaro and Chenzhi Zhu},
      title = {On the Adaptive Security of {FROST}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/1061},
      year = {2025},
      url = {https://eprint.iacr.org/2025/1061}
}

Schnorr Signatures are Tightly Secure in the ROM under a Non-interactive Assumption

@misc{cryptoeprint:2024/1528,
      author = {Gavin Cho and Georg Fuchsbauer and Adam O'Neill and Marek Sefranek},
      title = {Schnorr Signatures are Tightly Secure in the {ROM} under a Non-interactive Assumption},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/1528},
      year = {2024},
      url = {https://eprint.iacr.org/2024/1528}
}

T-Spoon: Tightly Secure Two-Round Multi-Signatures with Key Aggregation

@misc{cryptoeprint:2025/840,
      author = {Renas Bacho and Benedikt Wagner},
      title = {T-Spoon: Tightly Secure Two-Round Multi-Signatures with Key Aggregation},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/840},
      year = {2025},
      url = {https://eprint.iacr.org/2025/840}
}

Server-Aided Anonymous Credentials

@misc{cryptoeprint:2025/513,
      author = {Rutchathon Chairattana-Apirom and Franklin Harding and Anna Lysyanskaya and Stefano Tessaro},
      title = {Server-Aided Anonymous Credentials},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/513},
      year = {2025},
      url = {https://eprint.iacr.org/2025/513}
}

Multi-Holder Anonymous Credentials from BBS Signatures

@misc{cryptoeprint:2024/1874,
      author = {Andrea Flamini and Eysa Lee and Anna Lysyanskaya},
      title = {Multi-Holder Anonymous Credentials from {BBS} Signatures},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/1874},
      year = {2024},
      url = {https://eprint.iacr.org/2024/1874}
}

Consensus & Blockchain

Foundations of Platform-Assisted Auctions

@misc{cryptoeprint:2025/019,
      author = {Hao Chung and Ke Wu and Elaine Shi},
      title = {Foundations of Platform-Assisted Auctions},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/019},
      year = {2025},
      url = {https://eprint.iacr.org/2025/019}
}

Merkle Mountain Ranges are Optimal: On Witness Update Frequency for Cryptographic Accumulators

@misc{cryptoeprint:2025/234,
      author = {Joseph Bonneau and Jessica Chen and Miranda Christ and Ioanna Karantaidou},
      title = {Merkle Mountain Ranges are Optimal: On Witness Update Frequency for Cryptographic Accumulators},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/234},
      year = {2025},
      url = {https://eprint.iacr.org/2025/234}
}

State Machine Replication Among Strangers, Fast and Self-Sufficient

@misc{cryptoeprint:2025/616,
      author = {Juan Garay and Aggelos Kiayias and Yu Shen},
      title = {State Machine Replication Among Strangers, Fast and Self-Sufficient},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/616},
      year = {2025},
      url = {https://eprint.iacr.org/2025/616}
}

Leader Election with Poly-logarithmic Communication Per Party

@misc{cryptoeprint:2025/1016,
      author = {Amey Bhangale and Chen-Da Liu-Zhang and Julian Loss and Kartik Nayak and Sravya Yandamuri},
      title = {Leader Election with Poly-logarithmic Communication Per Party},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/1016},
      year = {2025},
      url = {https://eprint.iacr.org/2025/1016}
}

High-Throughput Permissionless Blockchain Consensus under Realistic Network Assumptions

@misc{cryptoeprint:2025/1115,
      author = {Sandro Coretti and Matthias Fitzi and Aggelos Kiayias and Giorgos Panagiotakos and Alexander Russell},
      title = {High-Throughput Permissionless Blockchain Consensus under   Realistic Network Assumptions},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/1115},
      year = {2025},
      url = {https://eprint.iacr.org/2025/1115}
}

Nearly Optimal Parallel Broadcast in the Plain Public Key Model

@misc{cryptoeprint:2025/1012,
      author = {Ran Gelles and Christoph Lenzen and Julian Loss and Sravya Yandamuri},
      title = {Nearly Optimal Parallel Broadcast in the Plain Public Key Model},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/1012},
      year = {2025},
      url = {https://eprint.iacr.org/2025/1012}
}

Lattice-based Cryptography

Wagner’s Algorithm Provably Runs in Subexponential Time for SIS

@misc{cryptoeprint:2025/575,
      author = {Léo Ducas and Lynn Engelberts and Johanna Loyer},
      title = {Wagner's Algorithm Provably Runs in Subexponential Time for {SIS}$^\infty$},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/575},
      year = {2025},
      url = {https://eprint.iacr.org/2025/575}
}

Refined Attack on LWE with Hints: Constructing Lattice via Gaussian Elimination

Jinzheng Cao, Haodong Jiang, Qingfeng Cheng

Uncompressing Dilithium’s public key

@misc{cryptoeprint:2024/1373,
      author = {Paco Azevedo Oliveira and Andersson Calle Viera and Benoît Cogliati and Louis Goubin},
      title = {Uncompressing Dilithium's public key},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/1373},
      year = {2024},
      url = {https://eprint.iacr.org/2024/1373}
}

Quantum Cryptography

How to Model Unitary Oracles

@misc{cryptoeprint:2025/1072,
      author = {Mark Zhandry},
      title = {How to Model Unitary Oracles},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/1072},
      year = {2025},
      url = {https://eprint.iacr.org/2025/1072}
}

Translating Between the Common Haar Random State Model and the Unitary Model

@misc{cryptoeprint:2025/489,
      author = {Eli Goldin and Mark Zhandry},
      title = {Translating Between the Common Haar Random State Model and the Unitary Model},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/489},
      year = {2025},
      url = {https://eprint.iacr.org/2025/489}
}

Pseudorandom Unitaries in the Haar Random Oracle Model

Prabhanjan Ananth, John Bostanci, Aditya Gulati, Yao-Ting Lin

Succinct Arguments for BatchQMA and Friends under 8 rounds

Rishab Goyal, Aditya Jain, Shashwatha Mitra G B

Reducing the Number of Qubits in Quantum Factoring

@misc{cryptoeprint:2024/222,
      author = {Clémence Chevignard and Pierre-Alain Fouque and André Schrottenloher},
      title = {Reducing the Number of Qubits in Quantum Factoring},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/222},
      year = {2024},
      url = {https://eprint.iacr.org/2024/222}
}

A Quasi-polynomial Time Algorithm for the Extrapolated Dihedral Coset Problem over Power-of-Two Moduli

@misc{cryptoeprint:2025/1046,
      author = {Shi Bai and Hansraj Jangir and Elena Kirshanova and Tran Ngo and William Youmans},
      title = {A Quasi-polynomial Time Algorithm for the Extrapolated Dihedral Coset Problem over Power-of-Two Moduli},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/1046},
      year = {2025},
      url = {https://eprint.iacr.org/2025/1046}
}

Quantum State Group Actions

@misc{cryptoeprint:2024/1636,
      author = {Saachi Mutreja and Mark Zhandry},
      title = {Quantum State Group Actions},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/1636},
      year = {2024},
      url = {https://eprint.iacr.org/2024/1636}
}

Quantum Lifting for Invertible Permutations and Ideal Ciphers

@misc{cryptoeprint:2025/738,
      author = {Alexandru Cojocaru and Minki Hhan and Qipeng Liu and Takashi Yamakawa and Aaram Yun},
      title = {Quantum Lifting for Invertible Permutations and Ideal Ciphers},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/738},
      year = {2025},
      url = {https://eprint.iacr.org/2025/738}
}

LWE with Quantum Amplitudes: Algorithm, Hardness, and Oblivious Sampling

@misc{cryptoeprint:2023/1498,
      author = {Yilei Chen and Zihan Hu and Qipeng Liu and Han Luo and Yaxin Tu},
      title = {{LWE} with Quantum Amplitudes: Algorithm, Hardness, and Oblivious Sampling},
      howpublished = {Cryptology {ePrint} Archive, Paper 2023/1498},
      year = {2023},
      url = {https://eprint.iacr.org/2023/1498}
}

Quantum Cryptography from Meta-Complexity

@misc{cryptoeprint:2024/1539,
      author = {Taiga Hiroka and Tomoyuki Morimae},
      title = {Quantum Cryptography from Meta-Complexity},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/1539},
      year = {2024},
      url = {https://eprint.iacr.org/2024/1539}
}

On the Power of Oblivious State Preparation

@misc{cryptoeprint:2024/1820,
      author = {James Bartusek and Dakshita Khurana},
      title = {On the Power of Oblivious State Preparation},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/1820},
      year = {2024},
      url = {https://eprint.iacr.org/2024/1820}
}

Compiled Nonlocal Games from any Trapdoor Claw-Free Function

@misc{cryptoeprint:2024/1829,
      author = {Kaniuar Bacho and Alexander Kulpe and Giulio Malavolta and Simon Schmidt and Michael Walter},
      title = {Compiled Nonlocal Games from any Trapdoor Claw-Free Function},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/1829},
      year = {2024},
      url = {https://eprint.iacr.org/2024/1829}
}

Quantum One-Time Protection of any Randomized Algorithm

@misc{cryptoeprint:2024/1798,
      author = {Sam Gunn and Ramis Movassagh},
      title = {Quantum One-Time Protection of any Randomized Algorithm},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/1798},
      year = {2024},
      url = {https://eprint.iacr.org/2024/1798}
}

Complexity‑Theoretic Foundations & Pseudorandomness

Uniform Black-Box Separations via Non-Malleable Extractors

@misc{cryptoeprint:2025/1060,
      author = {Marshall Ball and Dana Dachman-Soled},
      title = {Uniform Black-Box Separations via Non-Malleable Extractors},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/1060},
      year = {2025},
      url = {https://eprint.iacr.org/2025/1060}
}

Hardness Along the Boundary: Towards One-Way Functions from the Worst-case Hardness of Time-Bounded Kolmogorov Complexity

Yanyi Liu, Rafael Pass

Pseudorandomness Properties of Random Reversible Circuits

William Gay, William He, Nicholas Kocurek, Ryan O'Donnell

Efficient randomized strong 2-source non-malleable extractor for any linear min-entropy

@misc{cryptoeprint:2025/1421,
      author = {Divesh Aggarwal and Pranjal Dutta and Saswata Mukherjee and Satyajeet Nagargoje and Maciej Obremski},
      title = {Efficient randomized strong 2-source non-malleable extractor for any linear min-entropy},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/1421},
      year = {2025},
      url = {https://eprint.iacr.org/2025/1421}
}

Pseudorandom Functions

A Fully-Adaptive Threshold Partially-Oblivious PRF

@misc{cryptoeprint:2025/1433,
      author = {Ruben Baecker and Paul Gerhart and Daniel Rausch and Dominique Schröder},
      title = {A Fully-Adaptive Threshold Partially-Oblivious {PRF}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/1433},
      year = {2025},
      url = {https://eprint.iacr.org/2025/1433}
}

Adaptive Security for Constrained PRFs

Kaishuo Cheng, Joseph Jaeger

Succinct PPRFs via Memory-Tight Reductions

Joël Alwen, Chris Brzuska, Jérôme Govinden, Patrick Harasser, Stefano Tessaro

Traceable Verifiable Random Functions

@misc{cryptoeprint:2025/312,
      author = {Dan Boneh and Aditi Partap and Lior Rotem},
      title = {Traceable Verifiable Random Functions},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/312},
      year = {2025},
      url = {https://eprint.iacr.org/2025/312}
}

Obfuscation

Lattice-Based Post-Quantum iO from Circular Security with Random Opening Assumption (Part II: zeroizing attacks against private-coin evasive LWE assumptions)

@misc{cryptoeprint:2025/390,
      author = {Yao-Ching Hsieh and Aayush Jain and Huijia Lin},
      title = {Lattice-Based Post-Quantum {iO} from Circular Security with Random Opening Assumption (Part {II}: zeroizing attacks against private-coin evasive {LWE} assumptions)},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/390},
      year = {2025},
      url = {https://eprint.iacr.org/2025/390}
}

Lattice-based Obfuscation from NTRU and Equivocal LWE

@misc{cryptoeprint:2025/1129,
      author = {Valerio Cini and Russell W. F. Lai and Ivy K. Y. Woo},
      title = {Lattice-based Obfuscation from {NTRU} and Equivocal {LWE}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/1129},
      year = {2025},
      url = {https://eprint.iacr.org/2025/1129}
}

Pseudorandom Obfuscation and Applications

@misc{cryptoeprint:2024/1742,
      author = {Pedro Branco and Nico Döttling and Abhishek Jain and Giulio Malavolta and Surya Mathialagan and Spencer Peters and Vinod Vaikuntanathan},
      title = {Pseudorandom Obfuscation and Applications},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/1742},
      year = {2024},
      url = {https://eprint.iacr.org/2024/1742}
}

Simple and General Counterexamples for Private-Coin Evasive LWE

@misc{cryptoeprint:2025/374,
      author = {Nico Döttling and Abhishek Jain and Giulio Malavolta and Surya Mathialagan and Vinod Vaikuntanathan},
      title = {Simple and General Counterexamples for Private-Coin Evasive {LWE}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/374},
      year = {2025},
      url = {https://eprint.iacr.org/2025/374}
}