Zobrazeno 1 - 10
of 58
pro vyhledávání: '"Alagic, Gorjan"'
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
The Even-Mansour cipher is a simple method for constructing a (keyed) pseudorandom permutation $E$ from a public random permutation~$P:\{0,1\}^n \rightarrow \{0,1\}^n$. It is secure against classical attacks, with optimal attacks requiring $q_E$ quer
Externí odkaz:
http://arxiv.org/abs/2112.07530
Virtual black-box obfuscation is a strong cryptographic primitive: it encrypts a circuit while maintaining its full input/output functionality. A remarkable result by Barak et al. (Crypto 2001) shows that a general obfuscator that obfuscates classica
Externí odkaz:
http://arxiv.org/abs/2005.06432
Publikováno v:
Theory of Cryptography Conference (TCC), Lecture Notes in Computer Science 12552, 153-180 (2020)
In a recent breakthrough, Mahadev constructed an interactive protocol that enables a purely classical party to delegate any quantum computation to an untrusted quantum prover. In this work, we show that this same task can in fact be performed non-int
Externí odkaz:
http://arxiv.org/abs/1911.08101
Publikováno v:
Advances in Cryptology - EUROCRYPT 2020. EUROCRYPT 2020. Lecture Notes in Computer Science, vol 12107. Springer, Cham
We consider the problem of efficiently simulating random quantum states and random unitary operators, in a manner which is convincing to unbounded adversaries with black-box oracle access. This problem has previously only been considered for restrict
Externí odkaz:
http://arxiv.org/abs/1910.05729
Publikováno v:
Quantum 5, 603 (2021)
Cryptography with quantum states exhibits a number of surprising and counterintuitive features. In a 2002 work, Barnum et al. argue that these features imply that digital signatures for quantum states are impossible (Barnum et al., FOCS 2002). In thi
Externí odkaz:
http://arxiv.org/abs/1811.11858
Publikováno v:
Cryptography, vol. 4, no. 1:10 (2020)
Large-scale quantum computing is a significant threat to classical public-key cryptography. In strong "quantum access" security models, numerous symmetric-key cryptosystems are also vulnerable. We consider classical encryption in a model which grants
Externí odkaz:
http://arxiv.org/abs/1808.09655
Publikováno v:
In: Canteaut A., Ishai Y. (eds) Advances in Cryptology -- EUROCRYPT 2020. EUROCRYPT 2020. Lecture Notes in Computer Science, vol 12107. Springer, Cham
Formulating and designing authentication of classical messages in the presence of adversaries with quantum query access has been a longstanding challenge, as the familiar classical notions of unforgeability do not directly translate into meaningful n
Externí odkaz:
http://arxiv.org/abs/1803.03761
Publikováno v:
Advances in Cryptology - EUROCRYPT 2018. Lecture Notes in Computer Science, vol 10822. Springer, Cham
We study the problem of encrypting and authenticating quantum data in the presence of adversaries making adaptive chosen plaintext and chosen ciphertext queries. Classically, security games use string copying and comparison to detect adversarial chea
Externí odkaz:
http://arxiv.org/abs/1709.06539
Fully-homomorphic encryption (FHE) enables computation on encrypted data while maintaining secrecy. Recent research has shown that such schemes exist even for quantum computation. Given the numerous applications of classical FHE (zero-knowledge proof
Externí odkaz:
http://arxiv.org/abs/1708.09156