Results 1  10
of
13
Alexandria digital library
 Communications of the ACM
, 1995
"... We investigate definitions of and protocols for multiparty quantum computing in the scenario where the secret data are quantum systems. We work in the quantum informationtheoretic model, where no assumptions are made on the computational power of the adversary. For the slightly weaker task of veri ..."
Abstract

Cited by 36 (6 self)
 Add to MetaCart
We investigate definitions of and protocols for multiparty quantum computing in the scenario where the secret data are quantum systems. We work in the quantum informationtheoretic model, where no assumptions are made on the computational power of the adversary. For the slightly weaker task of verifiable quantum secret sharing, we give a protocol which tolerates any t < n/4 cheating parties (out of n). This is shown to be optimal. We use this new tool to establish that any multiparty quantum computation can be securely performed as long as the number of dishonest players is less than n/6.
On the Impossibility of Constructing NonInteractive StatisticallySecret Protocols from any Trapdoor OneWay Function
 In Topics in Cryptology  The Cryptographers’ Track at the RSA Conference
, 2002
"... We show that noninteractive statisticallysecret bit commitment cannot be constructed from arbitrary blackbox onetoone trapdoor functions and thus from general publickey cryptosystems. Reducing the problems of noninteractive cryptocomputing, rerandomizable encryption, and noninteractive stat ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
(Show Context)
We show that noninteractive statisticallysecret bit commitment cannot be constructed from arbitrary blackbox onetoone trapdoor functions and thus from general publickey cryptosystems. Reducing the problems of noninteractive cryptocomputing, rerandomizable encryption, and noninteractive statisticallysenderprivate oblivious transfer and lowcommunication private information retrieval to such commitment schemes, it follows that these primitives are neither constructible from onetoone trapdoor functions and publickey encryption in general. Furthermore, our...
Computational Collapse of Quantum State with Application to Oblivious Transfer
, 2003
"... ..."
(Show Context)
Computational indistinguishability between quantum states and its cryptographic application
 Advances in Cryptology – EUROCRYPT 2005
, 2005
"... We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secure ” against any polynomialtime quantum adversary. Our problem QSCDff is to distinguish between two types of random coset s ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
(Show Context)
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secure ” against any polynomialtime quantum adversary. Our problem QSCDff is to distinguish between two types of random coset states with a hidden permutation over the symmetric group of finite degree. This naturally generalizes the commonlyused distinction problem between two probability distributions in computational cryptography. As our major contribution, we show three cryptographic properties: (i) QSCDff has the trapdoor property; (ii) the averagecase hardness of QSCDff coincides with its worstcase hardness; and (iii) QSCDff is computationally at least as hard in the worst case as the graph automorphism problem. These cryptographic properties enable us to construct a quantum publickey cryptosystem, which is likely to withstand any chosen plaintext attack of a polynomialtime quantum adversary. We further discuss a generalization of QSCDff, called QSCDcyc, and introduce a multibit encryption scheme relying on the cryptographic properties of QSCDcyc.
Exact quantum algorithms for the leader election problem
 In Proceedings of the TwentySecond Symposium on Theoretical Aspects of Computer Science (STACS 2005), volume 3404 of Lecture Notes in Computer Science
, 2005
"... ar ..."
(Show Context)
Quantum commitments from complexity assumptions
 In Luca Aceto, Monika Henzinger, and Jir Sgall, editors, Automata, Languages and Programming, volume 6755 of Lecture
"... ar ..."
Abstract
, 2005
"... We propose a calculus of local equations over oneway measurement patterns [1], which preserves interpretations, and allows the rewriting of any pattern to a standard form where entanglement is done first, then measurements, then local corrections. We infer from this that patterns with no dependenci ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
We propose a calculus of local equations over oneway measurement patterns [1], which preserves interpretations, and allows the rewriting of any pattern to a standard form where entanglement is done first, then measurements, then local corrections. We infer from this that patterns with no dependencies, or using only Pauli measurements, can only realise unitaries belonging to the Clifford group. 1
Statistical Zero Knowledge and quantum . . .
, 2007
"... Oneway functions are a fundamental notion in cryptography, since they are the necessary condition for the existence of secure encryption schemes. Most examples of such functions, including Factoring, Discrete Logarithm or the RSA function, can be, however, inverted with the help of a quantum comput ..."
Abstract
 Add to MetaCart
Oneway functions are a fundamental notion in cryptography, since they are the necessary condition for the existence of secure encryption schemes. Most examples of such functions, including Factoring, Discrete Logarithm or the RSA function, can be, however, inverted with the help of a quantum computer. Hence, it is very important to study the possibility of quantum oneway functions, i.e. functions which are easily computable by a classical algorithm but are hard to invert even by a quantum adversary. In this paper, we provide a set of problems that are good candidates for quantum oneway functions. These problems include Graph NonIsomorphism, Approximate Closest Lattice Vector and Group NonMembership. More generally, we show that any hard instance of Circuit Quantum Sampling gives rise to a quantum oneway function. By the work of Aharonov and TaShma [2], this implies that any language in Statistical Zero Knowledge which is hardonaverage for quantum computers, leads to a quantum oneway function. Moreover, extending the result of Impagliazzo and Luby [10] to the quantum setting, we prove that quantum distributionally oneway functions are equivalent to quantum oneway functions.