Aug 2026· arXiv.org· Vol abs/2608.11187· 0 citations· 27 references
Computer SciencePhysics
TL;DR
This work shows that statistically secure bit commitment, satisfying both hiding and binding, can be constructed from hybrid locked physical unclonable functions (HLPUFs), a hardware primitive that combines classical hardware tokens and quantum communication.
Abstract
Bit commitment is impossible to achieve with unconditional security, even in quantum cryptogra- phy. We show that statistically secure bit commitment, satisfying both hiding and binding, can be constructed from hybrid locked physical unclonable functions (HLPUFs), a hardware primitive that combines classical hardware tokens and quantum communication. Our protocol uses these hardware assumptions in a novel and non-trivial way to achieve the first mistrustful two-party cryptographic protocol based on hybrid hardware modules. We prove statistical hiding and binding under natu- ral assumptions on the HLPUF and using a carefully designed challenge generation algorithm as a subroutine of our bit-commitment protocol. The construction also yields the first hardware-based coin-flipping protocol. Our results suggest a new paradigm for secure two-party cryptography in quantum networks, combining rigorous security guarantees with a concrete route toward practical implementation.
The Ring Learning with Errors (RLWE) problem has emerged as a foundational hardness assumption for post-quantum authenticated key exchange (AKE) protocols. In this paper, we propose a post-quantum and efficient RLWE-Based AKE protocol for mobile devices. We provide formal security reduction in the random oracle model u...
Gaurav Mittal, S. Pal, Dharminder Chaudhary· International Journal of Fou...· 0 citations
The majority of secure communication systems in use today rely on traditional cryptographic techniques like elliptic curve cryptography and RSA. But if quantum computing advances quickly, these conventional approaches could be more susceptible to assaults in the future. This creates a serious challenge for long-term da...
Anurag Sable, Vivek Pandey, Ajay Langade et al.· 2026 IEEE International Conf...· 0 citations
This paper presents concrete implementations of Zero-Knowledge Arguments (ZKAs), analogous to but distinct from traditional Σ-protocols, and describes two variants: one with dynamic public key encapsulation (CPA-DE) and another that is non-interactive (CPA-NI).
Randy Kuang, Daniel Johnson, D. Panario· Quantum Inf. Technol. J.· 0 citations
Pseudorandom permutations are ubiquitous in theoretical and applied cryptography. PRPs that offer security even against adversaries making quantum queries are of increasing interest, and used in applications ranging from constructing pseudorandom unitaries to separating SZK from BQP. A successful framework for construc...
G. Alagic, J. Carolan, Christian Majenz et al.· arXiv.org· 0 citations
MuckleTEE is proposed, a hardware-software co-design that hardens hybrid key exchange against a fully compromised host by confining only its security-critical state to a Trusted Execution Environment (TEE), while delegating heavy cryptographic operations and networking to the untrusted domain.
Wassim Yahyaoui, Matteo Steinbach, J. Naccache et al.· Proceedings of the 2026 ACM...· 0 citations
Assuming post-quantum one-way functions, this work constructs device-independent oblivious transfer and bit commitment that tolerate independent honest faults at a constant rate and adaptive, bidirectional quantum leakage between the laboratories at a constant rate.
Rishabh Batra, Zhi-Li Chen, Rahul Jain et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.