Security
A Post-Quantum Interactive Hashing Theorem
arXiv cs.CR0 views
arXiv:2611.06124v1 Announce Type: cross Abstract: Interactive hashing, introduced by Ostrovsky, Venkatesan, and Yung [OVY93], is a building block in many cryptographic protocols, including perfectly hiding commitments from one-way permutations [NOVY92]. Its multi-output generalization is a key ingredient in constructions of statistical zero-knowledge arguments for NP and statistically hiding commitments from arbitrary one-way functions [NOV06,HR07]. In this note, we give a post-quantum security proof for this multi-output interactive hashing protocol with arbitrary relations.
Source：https://arxiv.org/abs/2611.06124PreviousCatastrophic Overfitting is Weight Drift the Training Loss Cannot SeeNextA Bag of Tricks for Defending Deep Learning-based Face Recognition Pipelines against Backdoor Attacks
Related posts
Things that Matter -- Identifying Interactions and IoT Device Types in Encrypted Matter Traffic
0arXiv cs.CR
Automated Exploit and Security Test Generation: A Systematic Literature Review
0arXiv cs.CR
Quantum Key Exchange from Public Quantum Money
0arXiv cs.CR
Demystifying Information Flow Downgrading using the Real--Ideal Paradigm
0arXiv cs.CR
🚨 CISA confirms active exploitation of a WordPress Core vulnerability: CVE-2026-119977. The TOCTOU flaw could allow unauthenticated remote code execution during the upgrade process. WordPress fixed
0dev.to Security
Secrecy and Covertness Analysis of SWAN-Enabled Uplink EDMA-NOMA Systems
0arXiv eess.SP