惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

U
Unit 42
C
Cybersecurity and Infrastructure Security Agency CISA
Exploit-DB.com RSS Feed
Exploit-DB.com RSS Feed
Know Your Adversary
Know Your Adversary
S
Securelist
I
Intezer
AWS News Blog
AWS News Blog
L
LINUX DO - 热门话题
P
Privacy International News Feed
Recent Announcements
Recent Announcements
cs.CL updates on arXiv.org
cs.CL updates on arXiv.org
博客园 - 聂微东
Threat Intelligence Blog | Flashpoint
Threat Intelligence Blog | Flashpoint
Attack and Defense Labs
Attack and Defense Labs
N
News and Events Feed by Topic
The GitHub Blog
The GitHub Blog
C
Cyber Attacks, Cyber Crime and Cyber Security
Schneier on Security
Schneier on Security
N
Netflix TechBlog - Medium
爱范儿
爱范儿
B
Blog
CTFtime.org: upcoming CTF events
CTFtime.org: upcoming CTF events
cs.CV updates on arXiv.org
cs.CV updates on arXiv.org
C
CERT Recently Published Vulnerability Notes
Hacker News: Ask HN
Hacker News: Ask HN
Google DeepMind News
Google DeepMind News
Engineering at Meta
Engineering at Meta
Blog — PlanetScale
Blog — PlanetScale
WordPress大学
WordPress大学
S
Secure Thoughts
K
Kaspersky official blog
N
News | PayPal Newsroom
O
OpenAI News
Last Week in AI
Last Week in AI
C
Check Point Blog
D
Darknet – Hacking Tools, Hacker News & Cyber Security
Cyberwarzone
Cyberwarzone
Application and Cybersecurity Blog
Application and Cybersecurity Blog
T
Tor Project blog
大猫的无限游戏
大猫的无限游戏
Vercel News
Vercel News
D
Docker
Hugging Face - Blog
Hugging Face - Blog
T
Threat Research - Cisco Blogs
Cisco Talos Blog
Cisco Talos Blog
The Register - Security
The Register - Security
博客园 - 司徒正美
Martin Fowler
Martin Fowler
人人都是产品经理
人人都是产品经理
P
Palo Alto Networks Blog

Cryptology ePrint Archive

Fast Isogeny Evaluation on Binary Curves Quick Draw Queries: Lightweight Searchable Public-key Ciphertexts with Hidden Structures via Non-Interactive Key Exchange A Constructive Treatment of Authentication Boolean Arithmetic over $\mathbb{F}_2$ from Group Commutators HAWK with Hint: Algebraic Key Recovery from Side-Channel Leakage Post-Quantum Secure k-Times Traceable Ring Signature A Key Schedule Design and Evaluation under Boundary Round-Key Leakage 2G2T: Constant-Size, Statistically Sound MSM Outsourcing Proximity Signatures Breaking Optimized HQC: The First Cache-Timing Full Decryption Oracle Key-Recovery Attack in Post-Quantum Cryptography Efficient Partially Blind Signatures from Isogenies Evaluating PQC KEMs, Combiners, and Cascade Encryption via Adaptive IND-CPA Testing Using Deep Learning High-Throughput Side-Channel-Protected Stream Cipher Hardware for 6G Systems Efficient e = 3 Threshold RSA via Integer Coordinates for Intel SGX Zeal: PIR for Non-Cooperative Databases VEIL: Lightweight Zero-Knowledge for Hash-Based Multilinear Proof Systems Witness-Indistinguishable Arguments of Knowledge and One-Way Functions The many faces of Schnorr: a touch-up Open Problems in List Decoding and Correlated Agreement Compressed Key Exchange Protocol from Orientations of Large Discriminant Using AVX-512 SPLASH: SPeculative Leakage-Adaptive Secure Hardware An Efficient Identity-Based Blind Signature Scheme from SM9 Efficient Batch Threshold Encryption Using Partial Fraction Techniques A note on the Unsuitability of LIGA for Linkable Ring Signatures: The perils of non-commutativity Verification Facade: Masquerading Insecure Cryptographic Implementations as Verified Code Cryptographic Implications of Worst-Case Hardness of Time-Bounded Kolmogorov Complexity Efficient Merkle-Tree Consistent Accumulator FLOSS: Fast Linear Online Secret-Shared Shuffling Which Privacy Blanket is Optimal in the Shuffle Model? Applications of Bruhat-Chevalley-Renner Decomposition to Metric-Aware Code-Based Cryptography Expanders Meet Reed-Muller: Easy Instances of Noisy k-XOR Verifiable Divide-and-Conquer Pseudorandomness of UFLM: A Characterization via Its Linear Layer QED-Lite: Lightweight Detection of Quantum-Vulnerable ELF Binaries via Cryptographic Library Version Fingerprinting Reformulating the SNOVA Signature Scheme Game Theory Does Not Always Help: The Case of Statistical Multi-Party Coin Tossing Improved Codes and Decoders for HQC Delegate: Coalition Proof Incentivized Outsourced Computation with Smart Contracts Fast and Efficient Perfectly Secure Network-Agnostic Secure Computation Tighter Bounds for the Oblivious Bit-Fixing Inner Product Extractor on Biased Seeds Random Robust Secret Sharing with Perfect Privacy and its Applications Counting and recovering the quadratic relations of a vectorial function A Search-to-Decision Reduction for Continuous LWE Robot: Robust Threshold BBS+ in Two Rounds Perils of Parallelism: Transaction Fee Mechanisms under Execution Uncertainty Synthesis of RTL-based Characterization Programs for Fault Injection SSLE-DAG: A High-Throughput Proof-of-Stake Consensus Protocol Combining an Adaptive DAG with a Single Secret Leader Election On Optimal Information-Theoretic Security in Symmetric Encryption under Low-Entropy Keys Efficient and Parallel Implementation of Isogeny-based Deterministic Group Actions Fast and Compact Lattice-Based Registration-Based Encryption Graph-based Asynchrony with Quasilinear Complexity for Any Linear Verifiable Secret Sharing Scheme MTSF --- Market-Theoretic Security Framework: A Unified Paradigm For The Art Of Proving and Disproving Security Ticket to Hide: Private, Practical Proofs of Provenance for TLS Linear Code Equivalence via Plücker Coordinates Survey of isogeny-based signature schemes resistant to Castryck–Decru attack On the Need for (Quantum) Memory with Short Outputs Simulating Noisy Leakage with Bounded Leakage: Simpler, Better, Faster Relaxed Modular PCS from Arbitrary PCS and Applications to SNARKs for Integers Tripling on Hessian curves via isogeny decomposition Reducing the Number of Qubits in Quantum Discrete Logarithms on Elliptic Curves At-Compromise Security: The Case for Alert Blindness A Practical Neighborhood Search Attack on Oracle MLWE Designated-Verifier Dynamic zk-SNARKs with Applications to Dynamic Proofs of Index Abelian surfaces in Hesse form and explicit isogeny formulas Efficiently Provable Approximations for Non-Polynomial Functions Laminate: Succinct SIMD-Friendly Verifiable FHE Accelerating FrodoKEM in Hardware TSS-PV: Traceable Secret Sharing with Public Verifiability PIRANHAS: PrIvacy-Preserving Remote Attestation in Non-Hierarchical Asynchronous Swarms Small-field hash-based SNARGs are less sound than conjectured Hash-Based Blind Signatures: First Steps Partial Fraction Techniques for Cryptography VIA: Communication-Efficient Single-Server Private Information Retrieval Enabling Index-free Adjacency in Oblivious Graph Processing with Delayed Duplications Accurate BGV Parameters Selection: Accounting for Secret and Public Key Dependencies in Average-Case Analysis Multi-Party Functional Encryption (MPFE): A tool in the distributed and decentralized world Compact, Efficient and CCA-Secure Updatable Encryption from Isogenies Faster Homomorphic Integer Computer Tempo: An ML-KEM to PAKE Compiler Resilient to Timing Attacks OhLaLa: Combined Security against Region Fault Attacks in Constant Protection Order Threshold Signatures Reloaded: ML-DSA and Enhanced Raccoon with Identifiable Aborts The Pipes Model for Latency and Throughput Analysis Tighter Quantum Security for Fiat-Shamir-with-Aborts and Hash-and-Sign-with-Retry Signatures InstaRand: Instantly Available and Instantly Verifiable On-chain Randomness Simple and Efficient Lattice Threshold Signatures with Identifiable Aborts BERMUDA: A BPSec-Compatible Key Management Scheme for DTNs Making Uncertified DAG BFT Provably Live with Linear Payload and Quadratic Metadata Communication A proof of P≠NP (New symmetric encryption algorithm against any linear attacks and differential attacks) ETK: External-Operations TreeKEM and the Security of MLS in RFC 9420 A Combinatorial Attack on Ternary Sparse Learning with Errors (sLWE) A Divide-and-Conquer Strategy for Hard-Label Extraction of Deep Neural Networks via Side-Channel Attacks On the practicality of quantum sieving algorithms for the shortest vector problem Dynamic zk-SNARKs (with applications to sparse zk-SNARKs and IVC) ProxCode: Efficient Proximity Searchable Encryption from Error Correcting Codes Two-Round Threshold Signature from Algebraic One-More Learning with Errors The Last Challenge Attack on Fiat-Shamir in KZG-based SNARKs A New Perspective on Key Switching for BGV-like Schemes Improved Circuit Synthesis with Multi-Value Bootstrapping for FHEW-like Schemes DiStefano: Decentralized Infrastructure for Sharing Trusted Encrypted Facts and Nothing More Finding and Evaluating Parameters for BGV
How to Simulate Random Oracles with Auxiliary Input
Yevgeniy Dodis, New York University · 2026-05-01 · via Cryptology ePrint Archive

Paper 2026/854

How to Simulate Random Oracles with Auxiliary Input

Aayush Jain, Carnegie Mellon University

Huijia Lin, University of Washington

Ji Luo, University of Washington

Daniel Wichs, Northeastern University, NTT Research

Abstract

The *random oracle model* (ROM) allows us to optimistically reason about security properties of cryptographic hash functions, and has been hugely influential in designing practical cryptosystems. But it is overly optimistic against non-uniform adversaries, and often suggests security properties and security levels unachievable by any real hash function. To reconcile with this discrepancy, Unruh [CRYPTO ’07] proposed the *auxiliary-input random oracle model* (AI-ROM), where a non-uniform attacker additionally gets a bounded amount of advice about the random oracle. Proving security in the AI-ROM is often much more difficult, but a series of works starting with Unruh provided useful technical tools to do so. Although these tools lead to good results in the information-theoretic setting, they are unsatisfactory in the computational setting, where the random oracle is used alongside other computational hardness assumptions. At the most basic level, we did not even know whether it is possible to efficiently simulate random oracle queries given auxiliary input, which has remained as an explicit open problem since the work of Unruh. In this work, we resolve the above open problem and show how to efficiently simulate auxiliary-input random oracles. Moreover, the simulation has low concrete overhead, leading to small losses in exact security. We use it to prove the security of a broad class of computational schemes in the AI-ROM, including the first non-interactive zero-knowledge (NIZK) scheme in the AI-ROM. As a tool of independent interest, we develop a new notion of ultra-secure pseudorandom functions with fast RAM evaluation, which can achieve $2^\lambda$ security while having sublinear $\mathrm{o}(\lambda)$ evaluation time.

BibTeX

@misc{cryptoeprint:2026/854,
      author = {Yevgeniy Dodis and Aayush Jain and Huijia Lin and Ji Luo and Daniel Wichs},
      title = {How to Simulate Random Oracles with Auxiliary Input},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/854},
      year = {2026},
      doi = {10.1109/FOCS61266.2024.00080},
      url = {https://eprint.iacr.org/2026/854}
}