Adiabatic quantum computation is equivalent to standard quantum computation, Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science -FOCS'04, pp.42-51, 2004. ,
DOI : 10.1109/focs.2004.8
URL : http://arxiv.org/abs/quant-ph/0405098
Quantum cryptography: Public key distribution and coin tossing, Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing, pp.175-179, 1984. ,
DOI : 10.1016/j.tcs.2014.05.025
Experimental quantum cryptography, Journal of Cryptology, vol.5, issue.1, pp.3-28, 1992. ,
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky- Rosen channels, Phys. Rev. Lett, vol.70, pp.1895-1899, 1993. ,
Generalized privacy amplification, IEEE Transactions on Information Theory, issue.6, pp.411915-1923, 1995. ,
Practical Quantum Oblivious Transfer, Proceedings of Advances in Cryptology - CRYPTO'91, pp.362-371, 1992. ,
DOI : 10.1007/3-540-46766-1_29
A quantum bit commitment scheme provably unbreakable by both parties, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, pp.362-371, 1993. ,
DOI : 10.1109/SFCS.1993.366851
A brief review on the impossibility of quantum bit commitment, p.9712023, 1997. ,
Quantum entanglement and communication complexity, SIAM Journal on Computing, vol.30, pp.1829-1841 ,
Mixed-state entanglement and quantum error correction, Physical Review A, vol.54, issue.5, pp.3824-3851, 1996. ,
DOI : 10.1103/PhysRevA.54.3824
URL : http://arxiv.org/abs/quant-ph/9604024
On the Einstein-Podolsky-Rosen paradox, Physics Bennett. Logical reversibility of computation. IBM Journal of Research and Development, vol.1, issue.17, pp.195525-532, 1964. ,
The thermodynamics of computation? a review, International Journal of Theoretical Physics, vol.21, pp.905-940, 1982. ,
Quantum cryptography using any two nonorthogonal states, Phys. Rev. Lett, vol.68, issue.21, pp.3121-3124, 1992. ,
Notes on the history of reversible computation, IBM Journal of Research and Development, vol.44, pp.270-277, 2000. ,
Notes on Landauer's principle, reversible computation, and Maxwell's demon. Studies in the History and Philosophy of Modern Physics, pp.501-510, 2003. ,
Quantum foundations in the light of quantum cryptography, Invited talk at Quantum Physics of Nature & 6th European QIPC Workshop, 2005. ,
Parity bit in quantum cryptography, Physical Review A, vol.54, issue.4, pp.2675-2684, 1996. ,
DOI : 10.1103/PhysRevA.54.2675
Quantum information theory, IEEE Transactions on Information Theory, vol.44, issue.6, pp.2724-2742, 1998. ,
DOI : 10.1109/18.720553
Maxell's demon and the thermodynamics of computation. Studies in the History and Philosophy of Modern Physics, pp.569-579, 2001. ,
The quantum bit commitment theorem, Foundations of Physics, vol.31, issue.5, pp.735-756, 2001. ,
DOI : 10.1023/A:1017597528026
Is the quantum state (an) observable? In Potentiality, Entanglement and Passion-At-A-Distance: Quantum Mechanical Studies for Abner Shimony, page 61, p.9604014, 1997. ,
Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states, Physical Review Letters, vol.69, issue.20, pp.2881-2884, 1992. ,
DOI : 10.1103/PhysRevLett.69.2881
Characterizing quantum theory in terms of information-theoretic constraints, Foundations of Physics, vol.33, issue.11, pp.1561-1591, 2003. ,
DOI : 10.1023/A:1026056716397
Quantum bit commitment can be unconditionally secure, pp.quant-ph, 2003. ,
Achieving oblivious transfer using weakened security assumptions, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, pp.42-52, 1988. ,
DOI : 10.1109/SFCS.1988.21920
Efficient Unconditional Oblivious Transfer from Almost Any Noisy Channel, Proceedings of Fourth Conference on Security in Communication Networks -SCN'04, pp.47-59, 2004. ,
DOI : 10.1007/978-3-540-30598-9_4
Equivalence between two flavours of oblivious transfers, Proceedings of Advances in Cryptography -Crypto'87, pp.350-354, 1988. ,
Verifiable disclosure of secrets and applications, Proceedings of Advances in Cryptology -EUROCRYPT'89, pp.181-191, 1989. ,
Correct and Private Reductions among Oblivious Transfers, 1990. ,
Quantum oblivious transfer Efficient cryptographic protocols based on noisy channels, Cré97] C. Crépeau Proceedings of Advances in Cryptology -EUROCRYPT'97, pp.412445-2454, 1994. ,
Elements of Information Theory, 1991. ,
Universal classes of hash functions, Proceedings of the 9th Annual ACM Symposium on Theory of Computing -STOC'77, pp.106-112, 1977. ,
DOI : 10.1016/0022-0000(79)90044-8
Quantum Anonymous Transmissions, Proceedings of Advances in Cryptology -ASIACRYPT'05, pp.217-235, 2005. ,
DOI : 10.1007/11593447_12
Improving unconditional oblivious transfer from noisy channels, Proceedings of The 6th WSEAS International Conference on Information Security and Privacy (ISP'07), pp.1-9, 2007. ,
Lectures on quantum computation at the Center of Quantum Computation ,
Cryptography in the bounded quantum-storage model, Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science -FOCS'05, pp.449-458, 2005. ,
New directions in cryptography, IEEE Transactions on Information Theory, vol.22, issue.6, pp.22644-654, 1976. ,
DOI : 10.1109/TIT.1976.1055638
Overlap and distinguishability of quantum states, Physics Letters A, vol.126, pp.303-307, 1988. ,
On the (im)possibility of basing oblivious transfer and bit commitment on weakened security assumtions, Proceedings of Advances in Cryptology -EUROCRYPT'99, pp.56-73, 1999. ,
Quantum bit commitment revisited: the possible and the impossible, p.605224, 2006. ,
Quantum communication and complexity, Theoretical Computer Science, vol.287, issue.1, pp.337-353, 2002. ,
DOI : 10.1016/S0304-3975(02)00377-8
A randomized protocol for signing contracts, Communications of the ACM, vol.28, issue.6, pp.637-647, 1985. ,
DOI : 10.1145/3812.3818
Quantum cryptography based on Bell's theorem, Phys. Rev. Lett, vol.67, issue.6, pp.661-663, 1991. ,
Can quantum-mechanical description of physical reality be considered complete? Physical Review, pp.777-780, 1935. ,
Quantum computation by adiabatic evolution, 2000. ,
Conservative logic, International Journal of Theoretical Physics, vol.43, issue.3-4, pp.219-253, 1982. ,
DOI : 10.1007/BF01857727
Distinguishability and Accessible Information in Quantum Theory, pp.quant-ph, 1995. ,
Cryptographic distinguishability measures for quantum mechanical states, IEEE Transactions on Information Theory, vol.45, issue.4, pp.1216-1227, 1999. ,
From Quantum Cheating to Quantum Security, Physics Today, vol.53, issue.11, p.22, 2000. ,
DOI : 10.1063/1.1333282
Foundations of Cryptography -Volume I: Basic Tools, 2001. ,
Foundations of Cryptography -Volume II: Basic Applications, 2004. ,
Introduction to Quantum Mechanics, 2004. ,
A fast quantum mechanical algorithm for database search, Proceedings of the 28th annual ACM Symposium on Theory of computing - STOC'96, pp.212-219, 1996. ,
Quantum secret sharing, Physical Review A, vol.59, issue.3, pp.1829-1834, 1999. ,
DOI : 10.1103/PhysRevA.59.1829
A complete classification of quantum ensembles having a given density matrix, Physics Letters A, vol.183, issue.1, pp.14-18, 1993. ,
DOI : 10.1016/0375-9601(93)90880-9
Introduction to Automata Theory, Languages, and Computation, 2001. ,
DOI : 10.1145/568438.568455
How to differentiate between non-orthogonal states, Physics Letters A, vol.123, pp.257-259, 1987. ,
A fast and compact quantum random number generator, Review of Scientific Instruments, vol.71, issue.4, pp.1675-1680, 2000. ,
DOI : 10.1063/1.1150518
Fidelity for mixed quantum states Jaeger and A. Shimony. Optimal distinction between two non orthogonal quantum states, J. Mod. Opt. Physics Letters A, vol.41, issue.197, pp.2315-232383, 1994. ,
Coin tossing is strictly weaker than bit commitment, Phys. Rev. Lett, vol.83, pp.5382-9810067, 1999. ,
La cryptographie militaire, Journal des sciences militaires, vol.9, pp.5-83, 1883. ,
Founding cryptography on oblivious transfer, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp.20-31, 1988. ,
Quantum coin-flipping. Talk at QIP 2003. Slides and videos available at http://www.msri.org/publications/ln/msri, 2002. ,
Computational indistinguishability between quantum states and its cryptographic application, Proceedings of Advances in Cryptology -EUROCRYPT'05, pp.268-284, 2005. ,
Generalized Oblivious Transfer Protocols Based on Noisy Channels, Proceedings of the International Workshop on Information Assurance in Computer Networks -MMM-ACNS '01, pp.219-229, 2001. ,
DOI : 10.1007/3-540-45116-1_22
Quantum communication. Master's thesis, 1995. ,
Dissipation and heat generation in the computing process, IBM Journal of Research and Development, vol.5, pp.183-191, 1961. ,
Is Quantum Bit Commitment Really Possible?, Physical Review Letters, vol.78, issue.17, pp.3410-3413, 1997. ,
DOI : 10.1103/PhysRevLett.78.3410
URL : http://arxiv.org/abs/quant-ph/9603004
Why quantum bit commitment and ideal quantum coin tossing are impossible, Physica D: Nonlinear Phenomena, vol.120, issue.1-2, pp.177-187, 1998. ,
DOI : 10.1016/S0167-2789(98)00053-0
Unconditional Security of Quantum Key Distribution over Arbitrarily Long Distances, Science, vol.283, issue.5410, pp.2050-2056, 1999. ,
DOI : 10.1126/science.283.5410.2050
A computationally secure quantum oblivious transfer scheme, The 8th International Conference in Advanced Communication Technology -ICACT 2006, pp.1547-1551, 2006. ,
Insecurity of quantum secure computations, Phys. Rev. A, vol.56, pp.1154-1162, 1997. ,
Secret key agreement by public discussion from common information, IEEE Transactions on Information Theory, vol.39, p.733, 1993. ,
The trouble with quantum bit commitment, p.603015, 1996. ,
Unconditionally secure quantum bit commitment is impossible, Phys. Rev. Lett, vol.78, pp.3414-3417, 1997. ,
On cryptographic primitives based on noisy channels, 2005. ,
The Theory of Error-Correcting Codes, 1977. ,
Quantum Computation and Quantum Information, 2004. ,
Universal quantum computation using only projective measurement , quantum memory, and preparation of the 0 state, Phys. Lett. A, vol.308, pp.96-100, 2003. ,
How to differentiate between non-orthogonal states, Physics Letters A, vol.128, p.19, 1988. ,
Quantum Theory: Concepts and Methods, 2002. ,
Lecture notes of caltech course on quantum information and quantum computation Available at http://www.theory.caltech ,
How to exchange secrets by oblivious transfer, 1981. ,
A One-Way Quantum Computer, Physical Review Letters, vol.86, issue.22, pp.5188-5191, 2001. ,
DOI : 10.1103/PhysRevLett.86.5188
Adiabatic Quantum Computation, 2004. ,
A mathematical theory of communication, Bell System Technical Journal, vol.27, pp.379-423, 1948. ,
Communication theory of secrecy systems, Bell System Technical Journal, pp.28-4656, 1949. ,
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM Journal on Computing, vol.26, issue.5, pp.1484-1509, 1994. ,
Simple Proof of Security of the BB84 Quantum Key Distribution Protocol, Physical Review Letters, vol.85, issue.2, pp.441-444, 2000. ,
DOI : 10.1103/PhysRevLett.85.441
Cryptography -Theory and Practice, 1995. ,
Physicists triumph at " guess my number, Physics Today, vol.53, pp.35-39, 2000. ,
Efficient oblivious transfer from any non-trivial binarysymmetric channel, Proceedings of 2002 IEEE International Symposium on Information Theory -ISIT'02, p.293, 2002. ,
Violation of Bell Inequalities by Photons More Than 10 km Apart, Physical Review Letters, vol.81, issue.17, pp.3563-3566, 1998. ,
DOI : 10.1103/PhysRevLett.81.3563
Reversible computing, Proceedings of the 7th Colloquium on Automata , Languages and Programming, pp.632-644, 1980. ,
How powerful is adiabatic quantum computation?, Proceedings 2001 IEEE International Conference on Cluster Computing, pp.279-287, 2001. ,
DOI : 10.1109/SFCS.2001.959902
PSPACE has constant-round quantum interactive proof systems, Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science -FOCS'99, pp.112-119, 1999. ,
Conjugate coding, ACM SIGACT News, vol.15, issue.1, pp.78-88, 1970. ,
The Wire-Tap Channel, Bell System Technical Journal, vol.54, issue.8, pp.1355-1387, 1975. ,
DOI : 10.1002/j.1538-7305.1975.tb02040.x
A single quantum cannot be cloned, Nature, vol.15, issue.5886, pp.802-803, 1982. ,
DOI : 10.1038/299802a0
How to generate and exchange secrets, Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, pp.162-167, 1986. ,
Security of quantum protocols against coherent measurements, Proceedings of the 27th Annual ACM Symposium on Theory of Computing - STOC'95, pp.67-75, 1995. ,
Quantum information theory, the entropy bound, and mathematical rigor in physics, Quantum Communication, Computing, and Measurement, pp.17-23, 1997. ,
Unconditionally secure quantum bit commitment is possible, pp.6109-6116, 2000. ,
Quantum bit commitment and unconditional security, pp.quant- ph, 2002. ,
How to build unconditionally secure quantum bit commitment protocols, 2004. ,
Decohenrence and the transition from quantum to classical, Physics Today, vol.44, pp.36-44, 1991. ,