Abstract
In secure two-party function evaluation Alice holding initially a secret input x and Bob having a secret input y communicate to determine a prescribed function f(x, y) in such a way that after the computation Bob learns f(x, y) but nothing more about x other than he could deduce from y and f(x,y) alone, and Alice learns nothing. Unconditionally secure function evaluation is known to be essentially impossible even in the quantum world. In this paper we introduce a new, weakened, model for security in two-party quantum computations. In our model – we call it susceptible function computation – if one party learns something about the input of the other one with advantage ε then the probability that the correct value f(x,y) is computed, when the protocol completes, is at most 1 − δ(ε), for some function δ of ε. Thus, this model allows to measure the trade-off between the advantage of a dishonest party and the error induced by its attack. Furthermore, we present a protocol for computing the one-out-of-two oblivious transfer function that achieves a quadratic trade-off i.e. δ = Ω(ε 2).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aharonov, D., Kitaev, A., Nisan, N.: Quantum circuits with mixed states. In: Proc. STOC 1998, pp. 20–30 (1998)
Aharonov, D., Ta-Shma, A., Vazirani, U., Yao, A.: Quantum bit escrow. In: Proc. STOC 2000, pp. 705–714 (2000)
Ardehali, M.: A perfectly secure quantum bit commitment protocol, Los Alamos preprint archive quant-ph/9505019
Ardehali, M.: A simple quantum oblivious transfer protocols, Los Alamos preprint archive quant-ph/9512026
Beaver, D.: Perfect Privacy for Two Party Protocols, Technical Report TR-11-89, Harvard University (1989)
Beimel, A., Malkin, T., Micali, S.: The All-or-Nothing Nature of Two-Party Secure Computation. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 80–97. Springer, Heidelberg (1999)
Bennet, C., Brassard, G., Crépau, C., Skubiszewska, M.-H.: Practical quantum oblivious transfer. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 351–366. Springer, Heidelberg (1992)
Brassard, G., Crépau, C.: Quantum bit commitment and coin tossing protocols. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 49–61. Springer, Heidelberg (1991)
Brassard, G., Crépau, C., Robert, J.-M.: Information Theoretic Reductions Among Disclosure Problems. In: Proc. FOCS, pp. 168–173 (1986)
Brassard, G., Crépau, C., Jozsa, R., Langlois, D.: A quantum bit commitment scheme provably unbreakable by both parties. In: Proc. FOCS, pp. 362–371 (1993)
Chor, B., Kushilevitz, E.: A Zero-One Law for Boolean Privacy. SIAM Journal on Discrete Mathematics 4(1), 36–47 (1991)
Crépeau, C.: Equivalence between two flavors of oblivious transfers. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 350–354. Springer, Heidelberg (1988)
Crépeau, C.: Quantum oblivious transfer. Journal of Modern Optics 41(12), 2445–2454 (1994)
Crépeau, C., Salvail, L.: Quantum Oblivious Mutual Identification. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 133–146. Springer, Heidelberg (1995)
Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Comm. ACM 28, 637–647 (1985)
Fischer, M.J., Micali, S., Rackoff, C.: A secure protocol for the oblivious transfer. In: Proc. EUROCRYPT 1984 (1984); Printed version in J. of Cryptology, 9(3), 191-195 (1996)
Hardy, L., Kent, A.: Cheat Sensitive Quantum Bit Commitment. Phys. Rev. Lett. 92, 157901 (2004)
Kilian, J.: Founding cryptography on oblivious transfer. In: Proc. STOC, pp. 20–31 (1988)
Klauck, H.: Quantum and approximate privacy. Theory of Computing Systems 37(1), 221–246 (2004)
Kushilevitz, E.: Privacy and Communication Complexity. SIAM J. on Disc. Math. 5(2), 273–284 (1992)
Lo, H.K.: Insecurity of quantum secure computations. Phys. Rev. A 56, 1154–1162 (1997)
Rabin, M.O.: How to exchange secrets by oblivious transfer, Tech. Memo TR-81, Aiken Computation Laboratory (1981)
Yao, A.C.: Security of quantum protocols against coherent measurements. In: Proc. STOC, pp. 67–75 (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jakoby, A., Liśkiewicz, M., Mądry, A. (2008). Susceptible Two-Party Quantum Computations. In: Safavi-Naini, R. (eds) Information Theoretic Security. ICITS 2008. Lecture Notes in Computer Science, vol 5155. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85093-9_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-85093-9_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85092-2
Online ISBN: 978-3-540-85093-9
eBook Packages: Computer ScienceComputer Science (R0)