, au lieu de situer son vecteur parmi les 8 orthants possibles, elle se limitè a 4 orthants, quittè a changer le signe de a ? . Sa sortie indique précisément si elle a changé le signe ou non, Soit z =, issue.1 1 2
, on suppose que les joueurs peuvent tricher afin d'obtenir de l'information. De même, les joueurs doivent avoir apprisàapprisà la fin du protocole, aussi peu d'information que possible. Aussi peu que possible signifie que le joueur qui donne la valeur de la fonction ne doit rien apprendre d'autre que ce qu
, Celui-ci est conçu pour que la distribution reste identique, et pour y parvenir, Alice doit réactualiser son aléa en fonction des messages envoyés. ? Alice et Bob choisissent leur aléa r A et r B . ? A la i-` emé etape
, les joueurs tirent un message suivant la distribution : Prob[A i |A [i?1] , B [i?1] , r], c'est-` a-dire un message consistant avec l'aléa partagé r et l'historique des messages, en moyenne sur l'aléa privé r A d'Alice. L'idée est que d
, Nous allons dans un premier temps vérifier que la distribution est la même que dans le protocole original Dans un second temps, nous vérifierons que le protocole est bien défini. On a dans le nouveau protocole la distribution suivante : Prob[r A , r
, Nous avons ensuité etudié l'´ evaluation sécurisée Dans le modèle " honnête mais curieux " , nous avons caractérisé exactement le nombre de ET sécurisés nécessaires et suffisants pour calculer une fonction demanì ere sécurisée Comme une bo??tebo??te non-locale, cette ressource calcule le produit des entrées. Toutefois, le résultat du calcul avec un ET est donné directementàdirectementà un joueur, ce qui semblê etre une différence importante. Dans le cas probabiliste, nous avons donné des bornes inférieures et supérieures sur le nombre de bo??tesbo??tes OT nécessaires et suffisantes pour réaliser l'´ evaluation sécurisée. Les bo??tesbo??tes non-locales ontétéontété utiles dans les deux cas
, Experimental test of bell's inequalities using time-varying analyzers, Physical Review Letters, issue.25, pp.491804-1807, 1982.
, Experimental Tests of Realistic Local Theories via Bell's Theorem, Physical Review Letters, vol.47, issue.7, pp.460-463, 1981.
DOI : 10.1103/PhysRevLett.47.460
, : A New Violation of Bell's Inequalities, Physical Review Letters, vol.49, issue.2, pp.91-94, 1982.
DOI : 10.1103/PhysRevLett.49.91
, PRIMES is in P, Annals of Mathematics, vol.160, issue.2, pp.781-793, 2004.
DOI : 10.4007/annals.2004.160.781
, Proof verification and the hardness of approximation problems, Journal of the ACM, vol.45, issue.3, pp.501-555, 1998.
DOI : 10.1145/278298.278306
, Quantum lower bounds by quantum arguments, Journal of Computer and System Sciences, vol.64, issue.4, pp.750-767, 2002.
, The Space Complexity of Approximating the Frequency Moments, Journal of Computer and System Sciences, vol.58, issue.1, pp.137-147, 1999.
DOI : 10.1006/jcss.1997.1545
, Approximating the Cut-Norm via Grothendieck's Inequality, SIAM Journal on Computing, vol.35, issue.4, pp.787-803, 2006.
DOI : 10.1137/S0097539704441629
, Information processing in generalized probabilistic theories, Physical Review A, vol.75, issue.3, p.32304, 2007.
, Quantum cryptography: Public key distribution and coin tossing, Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, p.175, 1984.
DOI : 10.1016/j.tcs.2014.05.025
URL : http://doi.org/10.1016/j.tcs.2014.05.025
, Teleporting an unknown quantum state via dual classical and epr channels, Physical Review Letters, vol.70, pp.1895-1899, 1993.
, Quantum lower bounds by polynomials, Journal of the ACM, vol.48, issue.4, pp.778-797, 2001.
, Limit on nonlocality in any world in which communication complexity is not trivial, Physical Review Letters, issue.25, p.96250401, 2006.
, Generalized nobroadcasting theorem Substituting quantum entanglement for communication Cost of exactly simulating quantum entanglement with classical communication Implications of superstrong nonlocality for cryptography Quantum vs. classical communication and computation, Proc. of the 30th Annual ACM Symposium on Theory of ComputingBdW01] H. Buhrman and R. de Wolf. Communication complexity lower bounds by polynomials Proc. of the 16th Annual IEEE Conference on Computational ComplexityBea96] D. Beaver. Correlated pseudorandomness and the complexity of private computations Proc. of the 28th Annual ACM Symposium on Theory of Computing, pp.1201-12041874, 1996.
, Linear algebra methods in combinatorics. Preliminary Version 2 New applications of the incompressibility method : Part ii Randomized simultaneous messages : solution of a problem of yao incommunication complexity Non-local correlations as an information theoretic resource Beimel and T. Malkin. A quantitative approach to reductions in secure computation, Proc. of the 12th Annual IEEE Conference on Computational Complexity Proceedings of the First Theory of Cryptography ConferenceBNS92] L. Babai, N. Nisan, and M. Szegedy. Multiparty protocols, pseudorandom generators for LOGSPACE, and time-space trade-offs. Journal of Computer and System Sciences, pp.929-96919559, 1964.
, Completeness theorems for noncryptographic faulttolerant distributed computations, Proc. of the 20th Annual ACM Symposium on Theory of Computing, pp.1-10, 1988.
, Popescu-Rohrlich Correlations as a Unit of Nonlocality, Physical Review Letters, vol.95, issue.14, p.140401, 2005.
DOI : 10.1103/PhysRevLett.95.140401
, A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness, computational complexity, vol.15, issue.4, pp.391-432, 2006.
DOI : 10.1007/s00037-007-0220-2
, Non-locality distillation and postquantum theories with trivial communication complexity, 2009.
, Convex Optimization, 2004.
, Communication via one-and twoparticle operators on einstein-podolsky-rosen states, Physical Review Letters, issue.20, pp.692881-2884, 1992.
, Exponential Separation of Quantum and Classical One-Way Communication Complexity, SIAM Journal on Computing, vol.38, issue.1, pp.366-384, 2008.
DOI : 10.1137/060651835
, Information theory methods in communication complexity, Proceedings 17th IEEE Annual Conference on Computational Complexity, pp.93-102, 2002.
DOI : 10.1109/CCC.2002.1004344
, An information statistics approach to data stream and communication complexity, Journal of Computer and System Sciences, vol.68, issue.4, pp.702-732, 2004.
DOI : 10.1016/j.jcss.2003.11.006
, Multiparty unconditionally secure protocols, Proceedings of the twentieth annual ACM symposium on Theory of computing , STOC '88, pp.11-19, 1988.
DOI : 10.1145/62212.62214
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.649.1111
, Unbiased bits from sources of weak randomness and probabilistic communication complexity, SIAM Journal on Computing, vol.17, issue.2, 1988.
, Classical Teleportation of a Quantum Bit, Physical Review Letters, vol.84, issue.11, pp.2521-2524, 2000.
DOI : 10.1103/PhysRevLett.84.2521
, Simulating Maximal Quantum Entanglement without Communication, Physical Review Letters, vol.94, issue.22, p.94220403, 2005.
DOI : 10.1103/PhysRevLett.94.220403
, On the length of programs for computing finite binary sequences : Statistical considerations, Journal of the ACM, vol.16, issue.1, pp.145-169, 1969.
, A theory of program size formally identical to information theory, Journal of the ACM, vol.22, issue.3, pp.329-340, 1975.
, Proposed Experiment to Test Local Hidden-Variable Theories, Physical Review Letters, vol.23, issue.15, pp.880-884, 1969.
DOI : 10.1103/PhysRevLett.23.880
, Consequences and limits of nonlocal strategies, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004., pp.236-249, 2004.
DOI : 10.1109/CCC.2004.1313847
, A Zero-One Law for Boolean Privacy, SIAM Journal on Discrete Mathematics, vol.4, issue.1, pp.36-47, 1991.
DOI : 10.1137/0404004
, On Quantum Versions of the Yao Principle, Proc. of the 19th Annual Symposium on Theoretical Aspects of Computer Science, pp.347-358, 2002.
DOI : 10.1007/3-540-45841-7_28
, New directions in cryptography, IEEE Transactions on Information Theory, vol.22, issue.6, pp.644-654, 1976.
DOI : 10.1109/TIT.1976.1055638
, The Communication Complexity of Non-signaling Distributions, Proc. of the 34th International Symposium on Mathematical Foundations of Computer Science, 2009.
DOI : 10.1007/BF00417500
, Simulating quantum correlations as a distributed sampling problem, Physical Review A, vol.72, issue.6, p.72, 2005.
DOI : 10.1103/PhysRevA.72.062314
, The Quantum Moment Problem and Bounds on Entangled Multi-prover Games, 2008 23rd Annual IEEE Conference on Computational Complexity, pp.199-210, 2008.
DOI : 10.1109/CCC.2008.26
, Lower Bounds for Oblivious Transfer Reductions, Proc. of EUROCRYPT '99, pp.42-55, 1999.
DOI : 10.1007/3-540-48910-X_4
, Can quantum-mechanical description of physical reality be considered complete ? Physical Review, pp.777-780, 1935.
, Experimental Test of Local Hidden-Variable Theories, Physical Review Letters, vol.28, issue.14, pp.938-941, 1972.
DOI : 10.1103/PhysRevLett.28.938
, Simulating physics with computers, International Journal of Theoretical Physics, vol.21, issue.6, pp.467-488, 1982.
, Empirical logic and tensor products, Interpretations and Foundations of Quantum Theory, volume Interpretations and Foundations of Quantum Theory, pp.1-20, 1981.
, Distilling Nonlocality, Physical Review Letters, vol.102, issue.12, 2009.
DOI : 10.1103/PhysRevLett.102.120401
URL : http://arxiv.org/abs/0809.3173
, On the symmetry of algorithmic information of algorithmic information, Soviet Mathematics Doklady, vol.15, pp.1477-1480, 1974.
, Classical interaction cannot replace quantum nonlocality, 2009.
, Strengths and weaknesses of quantum fingerprinting, Proc. of the 21st Annual IEEE Conference on Computational Complexity, pp.288-295, 2006.
, Exponential separations for one-way quantum communication complexity, with applications to cryptography, Proc. of the 39th Annual ACM Symposium on Theory of Computing, pp.516-525, 2007.
, Résumé de la théorie métrique des produits tensoriels topologiques, pp.1-79, 1956.
, The elusive quantal individual, Physics Reports, vol.127, issue.6, pp.379-401, 1985.
, A fast quatum mechanical algorithm for database search, Proc. of the 28th Annual ACM Symposium on Theory of Computing, pp.212-219, 1996.
, How to solve any protocol problem -an efficiency improvement, Advances in Cryptology -CRYPTO '87, pp.73-86, 1988.
, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, Journal of the ACM, vol.42, issue.6, pp.1115-1145, 1995.
DOI : 10.1145/227683.227684
, Some optimal innappoximability results, Journal of the ACM, vol.48, issue.4, pp.798-859, 2001.
, Some estimates for the amount of information transmittable by a quantum communications channel, Problemy Peredachi Informatsii, vol.9, issue.3, pp.3-11, 1973.
, An Explicit Lower Bound of 5n ??? o(n) for Boolean Circuits, Proc. of the 27th International Symposium on Mathematical Foundations of Computer Science, pp.353-364, 2002.
DOI : 10.1007/3-540-45687-2_29
, Direct product theorems for classical communication complexity via subdistribution bounds, Proceedings of the fourtieth annual ACM symposium on Theory of computing, STOC 08
DOI : 10.1145/1374376.1374462
, Two applications of information complexity, Proceedings of the thirty-fifth ACM symposium on Theory of computing , STOC '03, pp.673-682, 2003.
DOI : 10.1145/780542.780640
, Random Graphs, 2000.
DOI : 10.1002/9781118032718
, Interconversion of nonlocal correlations, Physical Review A, vol.72, issue.5, p.52312, 2005.
DOI : 10.1103/PhysRevA.72.052312
, A class of constructive asymptotically good algebraic codes, IEEE Transactions on Information Theory, vol.18, pp.652-656, 1972.
, On the power of unique 2-prover 1-round games, Proc. of the 35th Annual ACM Symposium on Theory of Computing, pp.767-775, 2002.
, Basing cryptography on oblivious transfer, Proc. of the 20th Annual ACM Symposium on the Theory of Computing, pp.20-31, 1988.
, Quantum computations : algorithms and error correction, Russian Mathematical Survey, vol.52, pp.1191-1249, 1997.
, Non-local box complexity and secure function evaluation, 2009.
, Entangled games are hard to approximate, Proceedings of 49th Annual IEEE Symposium on Foundations of Computer Science, pp.447-456, 2008.
, Kolmogorov complexity and combinatorial methods in communication complexity, Proc. of the 6th Conference on Theory and Applications of Models of Computation, pp.261-270, 2009.
, Lower bounds for quantum communication complexity, SIAM Journal on Computing, vol.37, issue.1, pp.20-46, 2007.
, Communication complexity, 1997.
, On Randomized One-round Communication Complexity, Computational Complexity, vol.8, issue.1, pp.21-49, 1999.
DOI : 10.1007/s000370050018
, Three approaches to the quantitative definition of information, Problems of Information Transmission, vol.1, issue.1, pp.1-7, 1965.
, Quantum communication, 1995.
, Tensor products and probability weights, International Journal of Theoretical Physics, vol.17, issue.3, pp.199-219, 1987.
DOI : 10.1007/BF00668911
, Constantes de Grothendieck et fonctions de type positif sur les spheres, Advances in Math, vol.31, pp.16-30, 1979.
, The Probabilistic Communication Complexity of Set Intersection, SIAM Journal on Discrete Mathematics, vol.5, issue.4, pp.545-557, 1992.
DOI : 10.1137/0405044
, Privacy and communication complexity, SIAM Journal of Discrete Mathematics, vol.5, issue.2, pp.273-284, 1992.
, Monotone Circuits for Connectivity Require Super-Logarithmic Depth, SIAM Journal on Discrete Mathematics, vol.3, issue.2, pp.255-265, 1990.
DOI : 10.1137/0403021
, VLSI theory. Handbook of theoretical computer science A) : algorithms and complexity, pp.835-866, 1990.
, Lower bounds for randomized and quantum query complexity using kolmogorov arguments Lower bounds in communication complexity based on factorization norms. Random Structures and Algorithms An approximation algorithm for approximation rank A direct product theorem for discrepancy, Problems of Information TransmissionLS93] L. Lovàcz and M. Saks. Lattices, Möbius functions, and communication complexity Proc. of the 24th Annual IEEE Conference on Computational Complexity Proc. of the 23rd Annual IEEE Conference on Computational Complexity Unger. personal communicationLV08] M. Li and P. Vitanyi. An Introduction to Kolmogorov Complexity and Its ApplicationsMau92] T. Maudlin. Bell's inequality, information transmission, and prism models, pp.206-21046, 1974.
, Cramming more components onto integrated circuits Las vegas is better than determinism in vlsi and distributed computing [New91] I. Newman. Public vs. private coin flips in one round communication games A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations, Biennal Meeting of the Philosophy of Science Association Probabilistic Methods for Algorithmic Discrete Mathematics Proc. of the 14th Annual ACM Symposium on Theory of Computing 2008. 29 pages. [Pir03] S. Pironio. Violations of bell inequalities as lower bounds on the communication cost of nonlocal correlationsPR94] S. Popescu and D. Rohrlich. Causality and nonlocality as axioms for quantum mechanics. Foundations of PhysicsPSS84] W.J. Paul, J. Seiferas, and J. Simon. An information theoretic approach to time bounds for on-line computation. Journal of Computer and System Sciences, pp.404-417114, 1965.
, On the distributional complexity of disjointness, Theoretical Computer Science, vol.106, issue.2, pp.385-390, 1992.
DOI : 10.1016/0304-3975(92)90260-M
, Fourier analysis for probabilistic communication complexity, Computational Complexity, vol.106, issue.3-4, pp.205-221, 1995.
DOI : 10.1007/BF01206318
, Exponential separation of quantum and classical communication complexity, Proceedings of the thirty-first annual ACM symposium on Theory of computing , STOC '99, pp.358-367, 1999.
DOI : 10.1145/301250.301343
, Quantum communication complexity of symmetric predicates, Izvestiya : Mathematics, vol.67, issue.1, pp.145-159, 2003.
, Operational statistics and tensor products, Interpretations and Foundations of Quantum Theory, pp.21-28, 1981.
, Convex Analysis, 1970.
, On the ?log rank?-conjecture in communication complexity, Combinatorica, vol.108, issue.4, pp.567-588, 1995.
DOI : 10.1007/BF01192528
, Simulating quantum correlations with finite communication, Proc. of the 48th Annual IEEE Symposium on Foundations of Computer Science, pp.384-394, 2007.
, On the density of families of sets, Journal of Combinatorial Theory (A), vol.12, pp.145-147, 1972.
, A mathematical theory of communication, Bell System Technical Journal, vol.27, pp.379-423, 1948.
, The synthesis of two-terminal switching circuits, Bell System Technical Journal, vol.28, pp.59-98, 1949.
, Communication complexity under product and nonproduct distributions, Proc. of the 23rd Annual IEEE Conference on Computational Complexity, pp.64-70, 2008.
, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM Journal on Computing, vol.26, pp.1484-1509, 1997.
, A formal theory of inductive inference, part 1 and part 2, Information and Control, vol.7, pp.1-22, 1964.
, A Fast Monte-Carlo Test for Primality, SIAM Journal on Computing, vol.6, issue.1, pp.84-85, 1977.
DOI : 10.1137/0206006
, Towards quantifying non-local information transfer : finite-bit non-locality, Physical Letters A, vol.270, pp.239-244, 2000.
, Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum Measurement, SIAM Journal on Computing, vol.38, issue.3, pp.753-766, 2008.
DOI : 10.1137/050644768
, Communication Cost of Simulating Bell Correlations, Physical Review Letters, vol.91, issue.18, p.187904, 2003.
DOI : 10.1103/PhysRevLett.91.187904
, Quantum generalizations of Bell's inequality, Letters in Mathematical Physics, pp.93-100, 1980.
, Problems of the theory probability distributions ix English translation in Quantum analogues of the Bell inequalities. The case of two spatially separated domains, Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta, pp.174-194, 1985.
, On computable numbers, with an application to the entscheidungsproblem, Proceedings of the London Mathematical Society, pp.230-265, 1936.
, Lower bound on the communication cost of simulating bipartite quantum correlations [vD05] W. van Dam. Implausible consequences of superstrong nonlocality, 2005.
, Conjugate coding ACM SIGACT News -A special issue in cryptography, pp.78-88, 1983.
, Tensor products in generalized measure theory, International Journal of Theoretical Physics, issue.11, pp.311915-1928, 1992.
, Oblivious transfer and quantum non-locality, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., pp.1745-1748, 2005.
DOI : 10.1109/ISIT.2005.1523644
, Oblivious Transfer Is Symmetric, Proc. of EUROCRYPT '06, pp.222-232, 2006.
DOI : 10.1007/11761679_14
, Probabilistic computations : Toward a unified measure complexity (extended abstract), Proc. of the 18th Annual Symposium on Foudations of Computer Science, pp.222-227, 1977.
, Some complexity questions related to distributive computing
, Protocols for secure computations (extended abstract) In proc, of the 23rd Annual Symposium of Foundations of Computer Science, pp.160-164, 1982.
, Lower bounds by probabilistic arguments (extended abstract)
, Quantum circuit complexity, Proc. of the 34th Annual IEEE Symposium on Foundations of Computer Science, pp.352-361, 1993.
, On the power of quantum fingerprinting, Proc. of the 35th Annual ACM Symposium on Theory of Computing, pp.77-81, 2003.