TL;DR
The first adaptively-secure FBE and IBBE schemes with all parameter sizes independent of the number of users are presented, both under the same falsifiable lattice assumption and in the same model as the prior state-of-the-art for slotted distributed BE.
In recent years, the rapid growth of wireless technologies and the widespread use of mobile devices have drawn people toward diverse web applications. Today, users can conveniently access a variety of online services anytime and anywhere through their mobile devices. With wireless communication becoming the dominant me...
We present a unified framework for upgrading a broad class of cryptographic primitives to support constant-rate certified deletion. Previous constructions require a linear number of qubits per encrypted bit of certified-deletable plaintext. In contrast, we obtain the first constant-rate constructions in the plain model...
However, no known work considered the functionality requirement in its most realistic setting. We propose a new security definition of BAEKS in the multi-user (with adaptive corruptions) and multi-challenge (both in terms of ciphertext and trapdoor in an interleaved manner) settings. We also study the question of the u...
This paper presents Project Anonymous, an open-source platform for real-time voice, video, and text communication, deployable on both web browsers and Android, built entirely on the NIST-standardized ML-KEM-1024 (FIPS 203) and ML-DSA-87 (FIPS 204) primitives. Inorder to secure from Shor’s algorithm offering a reduced p...
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...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
