Zobrazeno 1 - 10
of 10 018
pro vyhledávání: '"Poremba A"'
Fundamental principles of quantum mechanics have inspired many new research directions, particularly in quantum cryptography. One such principle is quantum no-cloning which has led to the emerging field of revocable cryptography. Roughly speaking, in
Externí odkaz:
http://arxiv.org/abs/2410.13163
Quantum pseudorandomness has found applications in many areas of quantum information, ranging from entanglement theory, to models of scrambling phenomena in chaotic quantum systems, and, more recently, in the foundations of quantum cryptography. Kret
Externí odkaz:
http://arxiv.org/abs/2410.08073
Uniformly random unitaries, i.e. unitaries drawn from the Haar measure, have many useful properties, but cannot be implemented efficiently. This has motivated a long line of research into random unitaries that "look" sufficiently Haar random while al
Externí odkaz:
http://arxiv.org/abs/2404.12647
Autor:
Carolan, Joseph, Poremba, Alexander
Sponge hashing is a widely used class of cryptographic hash algorithms which underlies the current international hash function standard SHA-3. In a nutshell, a sponge function takes as input a bit-stream of any length and processes it via a simple it
Externí odkaz:
http://arxiv.org/abs/2403.04740
Pseudorandom unitaries (PRUs) are ensembles of efficiently implementable unitary operators that cannot be distinguished from Haar random unitaries by any quantum polynomial-time algorithm with query access to the unitary. We present a simple PRU cons
Externí odkaz:
http://arxiv.org/abs/2402.14803
We study digital signatures with revocation capabilities and show two results. First, we define and construct digital signatures with revocable signing keys from the LWE assumption. In this primitive, the signing key is a quantum state which enables
Externí odkaz:
http://arxiv.org/abs/2312.13561
We develop a simple compiler that generically adds publicly-verifiable deletion to a variety of cryptosystems. Our compiler only makes use of one-way functions (or one-way state generators, if we allow the public verification key to be quantum). Prev
Externí odkaz:
http://arxiv.org/abs/2304.09846
We build quantum cryptosystems that support publicly-verifiable deletion from standard cryptographic assumptions. We introduce target-collapsing as a weakening of collapsing for hash functions, analogous to how second preimage resistance weakens coll
Externí odkaz:
http://arxiv.org/abs/2303.08676
Publikováno v:
IACR Communications in Cryptology, Vol. 1, no. 1, Apr 09, 2024
In the permutation inversion problem, the task is to find the preimage of some challenge value, given oracle access to the permutation. This is a fundamental problem in query complexity, and appears in many contexts, particularly cryptography. In thi
Externí odkaz:
http://arxiv.org/abs/2306.13729
State transformation problems such as compressing quantum information or breaking quantum commitments are fundamental quantum tasks. However, their computational difficulty cannot easily be characterized using traditional complexity theory, which foc
Externí odkaz:
http://arxiv.org/abs/2306.13073