Engineering secure two-party computation protocols: Design, optimization, and applications of efficient secure function evaluation

Engineering Secure Two-Party Computation Protocols: Design, Optimization, and Applications of Efficient Secure Function Evaluation

Volumn 9783642300424, Issue , 2012, Pages 1-138

  Schneider, Thomas ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; CRYPTOGRAPHY; FUNCTION EVALUATION; SECURITY OF DATA;

ALGORITHM ENGINEERING; CIRCUIT OPTIMIZATION; COMPUTERS AND COMMUNICATIONS; CRYPTOGRAPHIC PROTOCOLS; DESIGN AND IMPLEMENTATIONS; PRIVACY ENHANCING TECHNOLOGIES; SECURE FUNCTION EVALUATION; SECURE TWO-PARTY COMPUTATIONS;

DATA PRIVACY;

EID: 84930238556     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-642-30042-4     Document Type: Book

References (234)

1. G. Aggarwal, N. Mishra, B. Pinkas, Secure computation of the kth-ranked element, in Advances in Cryptology-EUROCRYPT'04, LNCS, vol. 3027 (Springer, 2004), pp. 40-55.
2. D. Agrawal, B. Archambeault, J.R. Rao, P. Rohatgi, The EM side-channel(s), in Cryptographic Hardware and Embedded Systems (CHES'02), LNCS, vol. 2523 (Springer, 2002), pp. 29-45.
3. W. Aiello, Y. Ishai, O. Reingold, Priced oblivious transfer: how to sell digital goods, in Advances in Cryptology-EUROCRYPT01, LNCS, vol. 2045 (Springer, 2001) pp.119-135.
4. M.-L. Akkar, C. Giraud, An implementation of DES and AES, secure against some attacks, in Cryptographic Hardware and Embedded Systems (CHES'01), LNCS, vol. 2162 (Springer, 2001), pp. 309-318.
5. J. Algesheimer, C. Cachin, J. Camenisch, G. Karjoth, Cryptographic security for mobile code, in IEEE Symposium on Security and Privacy (S&P'01), 2001, pp. 2-11.
6. E. Allender, M.C. Loui, K.W. Regan, Complexity classes, in Algorithms and Theory of Computation Handbook, Chapter 27, ed. by M.J. Atallah (CRC Press, Rockville, 1999).
7. J.B. Almeida, E. Bangerter, M. Barbosa, S. Krenn, A.-R. Sadeghi, T. Schneider, A certifying compiler for zero-knowledge proofs of knowledge based on sigma-protocols, in European Symposium on Research in Computer Security (ESORICS'10), LNCS, 20-22 September 2010, vol. 6345 (Springer, 2010), pp. 151-167, http://eprint.iacr.org/2010/339.
8. Amazon Elastic Compute Cloud (EC2), http://aws.amazon.com/ec2.
9. Amazon High Performance Computing (HPC), http://aws.amazon.com/ec2/hpc-applications/.
10. Amazon Simple Storage Service (S3), http://aws.amazon.com/s3.
11. M.J. Atallah, K.N. Pantazopoulos, J.R. Rice, E.H. Spafford, Secure outsourcing of scientific computations. Adv. Comput. 54, 216-272 (2001).
12. Y. Aumann, Y. Lindell, Security against covert adversaries: efficient protocols for realistic adversaries, in Theory of Cryptography (TCC'07), LNCS, vol. 4392 (Springer, 2007) pp. 137-156.
13. S. Avidan, M. Butman, Efficient methods for privacy preserving face detection, in Advances in Neural Information Processing Systems (NIPS'06) (MIT Press, 2006), pp. 57-64.
14. E. Bangerter, M. Barbosa, D.J. Bernstein, I. Damgård, D. Page, J.I. Pagter, A.-R. Sadeghi, S. Sovio, Using compilers to enhance cryptographic product development, in Information Security Solutions, Europe (ISSE'09), (Vieweg+Teubner, 2009), pp. 291-301.
15. E. Bangerter, S. Barzan, S. Krenn, A.-R. Sadeghi, T. Schneider, J.-K. Tsay, Bringing zeroknowledge proofs of knowledge to practice, in International Workshop on Security Protocols (SPW'09), 1-3 April 2009, http://eprint.iacr.org/2009/211.
16. E. Bangerter, J. Camenisch, S. Krenn, A.-R. Sadeghi, T. Schneider, Automatic generation of sound zero-knowledge protocols. Advances in Cryptology-EUROCRYPT 2009 Poster Session, 26-30 April 2009, http://eprint.iacr.org/2008/471.
17. E. Bangerter, T. Briner, W. Henecka, S. Krenn, A.-R. Sadeghi, T. Schneider, Automatic generation of sigma-protocols, in European Workshop on Public Key Services, Applications and Infrastructures (EUROPKI'09), LNCS, vol. 6391 Springer, 10-11 Sept 2009, pp. 67-82, http://www.cace-project.eu/index.php?Itemid=15.
18. E. Bangerter, S. Krenn, A.-R. Sadeghi, T. Schneider, YAZKC: Yet another zero-knowledge compiler. 19th USENIX Security Symposium (Security'10) Poster Session, 11-13 Aug 2010.
19. M. Barni, P. Failla, V. Kolesnikov, R. Lazzeretti, A.-R. Sadeghi, T. Schneider, Secure evaluation of private linear branching programs with medical applications, in European Symposium on Research in Computer Security (ESORICS'09), LNCS, vol. 5789 Springer, 21-25 Sept 2009, pp. 424-439, http://eprint.iacr.org/2009/195.
20. M. Barni, P. Failla, V. Kolesnikov, R. Lazzeretti, A. Paus, A.-R. Sadeghi, T. Schneider, Efficient privacy-preserving classification of ECG signals, in IEEE International Workshop on Information Forensics and Security (IEEE WIFS'09), 6-9 Dec 2009, pp. 91-95.
21. M. Barni, T. Bianchi, D. Catalano, M. Di Raimondo, R.D. Labati, P. Failla, D. Fiore, R. Lazzeretti, V. Piuri, F. Scotti, A. Piva, Privacy-preserving fingercode authentication, in ACM Workshop on Multimedia and Security (MM&Sec'10) ACM, (ACM, 2010), pp. 231-240, http://www.dmi.unict.it/diraimondo/uploads/papers/fingercode-protocol.pdf.
22. M. Barni, P. Failla, R. Lazzeretti, A.-R. Sadeghi, T. Schneider, Privacy-preserving ECG classification with branching programs and neural networks. IEEE Trans. Inf. Forensics Secur. (TIFS) 6(2), 452-468 (2011).
23. D. Beaver, Precomputing oblivious transfer, in Advances in Cryptology-CRYPTO'95, LNCS, vol. 963 (Springer, 1995), pp. 97-109.
24. M. Bellare, P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols, in ACM Conference on Computer and Communications Security (CCS'93), (ACM, 1993), pp. 62-73.
25. A. Ben-David, N. Nisan, B. Pinkas, Fairplay MP: A system for secure multi-party computation, in ACM Conference on Computer and Communications Security (CCS08), (ACM, 2008), pp.257-266, http://fairplayproject.net/fairplayMP.html.
26. M. Ben-Or, S. Goldwasser, A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation, in ACM Symposium on Theory of Computing (STOC'88), (ACM, 1988), pp. 1-10.
27. S. Berger, R. Cáceres, K.A. Goldman, R. Perez, R. Sailer, L. van. Doorn. vTPM: virtualizing the trusted platform module, in USENIX Security Symposium (Security'06), 2006, pp. 305-320.
28. C.L. Berman, Circuit width, register allocation, and ordered binary decision diagrams. IEEE Trans. CAD Integr. Circuits Syst. 10(8), 1059-1066 (1991).
29. I.F. Blake, V. Kolesnikov, Strong conditional oblivious transfer and computing on intervals, in Advances in Cryptology-ASIACRYPT'04, LNCS, vol. 3329 (Springer, 2004), pp. 515-529.
30. M. Blanton, P. Gasti, Secure and efficient protocols for iris and fingerprint identification, in European Symposium on Research in Computer Security (ESORICS'11), LNCS, vol. 6879 (Springer, 2011), pp. 190-209.
31. T. Blass, Multi-GPU Cluster use for Java/OpenMP, Master's thesis, Friedrich-Alexander University Erlangen-Nürnberg, Germany, 2010.
32. D. Bogdanov, S. Laur, J. Willemson, Sharemind: A framework for fast privacy-preserving computations, in European Symposium on Research in Computer Security (ESORICS'08), LNCS, vol. 5283 (Springer, 2008), pp. 192-206.
33. B. Bollig, I. Wegener, Improving the variable ordering of OBDDs is NP-complete. IEEE Trans. Comput. 45(9), 993-1002 (1996).
34. D. Boneh, E.-J. Goh, K. Nissim, Evaluating 2-DNF formulas on ciphertexts, in Theory of Cryptography Conference (TCC'05), LNCS, vol. 3378 (Springer, 2005), pp. 325-341.
35. O. Bowcott, Interpol wants facial recognition database to catch suspects. Guardian 20 Oct 2008, http://www.guardian.co.uk/world/2008/oct/20/interpol-facial-recognition.
36. J. Boyar, R. Peralta, Short discrete proofs, in Advances in Cryptology EUROCRYPT'96, LNCS, vol. 1070 (Springer, 1996), pp. 131-142.
37. J. Boyar, R. Peralta, Concrete multiplicative complexity of symmetric functions, in Mathematical Foundations of Computer Science (MFCS'06), LNCS, vol. 4162 (Springer, 2006), pp. 179-189.
38. J. Boyar, R. Peralta, A new combinational logic minimization technique with applications to cryptology, in Symposium on Experimental Algorithms (SOA'10), LNCS, vol. 6049 (Springer, 2010), pp. 178-189.
39. J. Boyar, G. Brassard, R. Peralta, Subquadratic zero-knowledge, in IEEE Symposium on Foundations of Computer Science (FOCS'91), 1991, pp. 69-78.
40. J. Boyar, C. Lund, R. Peralta, On the communication complexity of zero-knowledge proofs. J. Cryptol. 6(2), 65-85 (1993).
41. J. Boyar, G. Brassard, R. Peralta, Subquadratic zero-knowledge. J. ACM 42(6), 1169-1193 (1995).
42. J. Boyar, I. Damgård, R. Peralta, Short non-interactive cryptographic proofs. J. Cryptol. 13(4), 449-472 (2000).
43. J. Boyar, R. Peralta, D. Pochuev, On the multiplicative complexity of Boolean functions over the basis Theor. Comput. Sci. 235(1), 43-57 (2000).
44. X. Boyen, Y. Dodis, J. Katz, R. Ostrovsky, A. Smith, Secure remote authentication using biometric data, in Advances in Cryptology EUROCRYPT'05, LNCS, vol. 3494 (Springer, 2005), pp. 147-163.
45. G. Brassard, C. Crépeau, Zero-knowledge simulation of boolean circuits, in Advances in Cryptology-CRYPTO'86, LNCS, vol. 263 (Springer, 1986), pp. 223-233.
46. J. Brickell, V. Shmatikov, Privacy-preserving classifier learning, in Financial Cryptography and Data Security (FC'09), LNCS, vol. 5628 (Springer, 2009), pp. 128-147.
47. J. Brickell, D.E. Porter, V. Shmatikov, E. Witchel, Privacy-preserving remote diagnostics, in ACM Computer and Communications Security (CCS'07), (ACM, 2007), pp. 498-507.
48. T. Briner, Compiler for zero-knowledge proof-of-knowledge protocols, Master's thesis, ETH Zurich, Switzerland, 2004.
49. R.E. Bryant, On the complexity of VLSI implementations and graph representations of boolean functions with application to integer multiplication. IEEE Trans. Compu. 40(2), 205213 (1991).
50. S. Bugiel, S. Nürnberger, A.-R. Sadeghi, T. Schneider, Twin clouds: secure cloud computing with low latency, in Communications and Multimedia Security Conference (CMS11), LNCS, vol. 7025 Springer, 19-21 Oct. 2011.
51. A. Bussani, J.L. Griffin, B. Jasen, K. Julisch, G. Karjoth, H. Maruyama, M. Nakamura, R. Perez, M. Schunter, A. Tanner, L. van Doorn, E. van Herreweghen, M. Waidner, S. Yoshihama, Trusted Virtual Domains: Secure Foundations for Business and IT Services. Technical Report Research Report RC23792, IBM Research, Nov 2005.
52. S.Cabuk, C.I.Dalton, K.Eriksson, D.Kuhlmann, H.V.Ramasamy, G. Ramunno, A.-R. Sadeghi, M. Schunter, C. Stüble, Towards automated security policy enforcement in multi-tenant virtual data centers. J.Comput. Secur. 18, 89-121 (2010).
53. C. Cachin, J. Camenisch, J. Kilian, J. Müller. One-round secure computation and secure autonomous mobile agents, in International Colloquium on Automata, Languages and Programming (ICALP'00), LNCS, vol. 1853 (Springer, 2000), pp. 512-523.
54. J. Camenisch, M. Rohe, A.-R. Sadeghi, Sokrates-a compiler framework for zeroknowledge protocols, in Western European Workshop on Research in Cryptology (WEWoRC'05), 2005.
55. R. Canetti, Universally composable security: A new paradigm for cryptographic protocols, in IEEE Symposium on Foundations of Computer Science (FOCS'01), 2001, pp. 136-145.
56. R. Canetti, Y. Lindell, R. Ostrovsky, A. Sahai, Universally composable two-party and multi-party secure computation, in ACM Symposium on Theory of Computing (STOC'02), (ACM, 2002), pp. 494-503.
57. R. Canetti, O. Goldreich, S. Halevi, The random oracle methodology, revisited. J. ACM 51(4), 557-594 (2004).
58. G.J. Chaitin, M.A. Auslander, A.K. Chandra, J. Cocke, M.E. Hopkins, P.W. Markstein, Register allocation via coloring. Comput. Lang. 6(1), 47-57 (1981).
59. N. Chandran, V. Goyal, A. Sahai, New constructions for UC secure computation using tamper-proof hardware, in Advances in Cryptology-EUROCRYPT'08, LNCS, vol. 4965 (Springer, 2008), pp. 545-562.
60. S.G. Choi, J. Katz, R. Kumaresan, H.-S Zhou, On the security of the free-xor technique. Cryptology ePrint Archive, Report 2011/510, 2011, http://eprint.iacr.org/2011/510.
61. R. Chow, P. Golle, M. Jakobsson, E. Shi, J. Staddon, R. Masuoka, J. Molina, Controlling data in the cloud: outsourcing computation without outsourcing control, in ACM Cloud Computing Security Workshop (CCSW'09), (ACM, 2009), pp. 85-90.
62. K.-M. Chung, Y. Kalai, S. Vadhan, Improved delegation of computation using fully homomorphic encryption, in Advances in Cryptology CRYPTO'10, LNCS, vol. 6223 (Springer, 2010), pp. 583-501.
63. Cloud Security Alliance (CSA), Top threats to cloud computing, version 1.0, http://www.cloudsecurityalliance.org/topthreats/csathreats.v1.0.pdf, March 2010.
64. T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, Introduction to Algorithms, 2nd edn. (The MIT Press, Cambridge, 2001).
65. I. Damgård, M. Jurik, A generalisation, a simplification and some applications of Paillier's probabilistic public-key system, in Public-Key Cryptography (PKC'01), LNCS, vol. 1992 (Springer, 2001), pp. 119-136.
66. I. Damgård, M. Geisler, M. Krøigaard, Efficient and secure comparison for on-line auctions, in Australasian Conference on Information Security and Privacy (ACISP'07), LNCS, vol. 4586 (Springer, 2007), pp. 416-430.
67. I. Damgård, M. Geisler, M. Krøigaard. A correction to Efficient and secure comparison for on-line auctions. Cryptology ePrint Archive, Report 2008/321, 2008.
68. I. Damgård, M. Geisler, M. Krøigaard, Homomorphic encryption and secure comparison. J.Appl. Cryptol. 1(1), 22-31 (2008).
69. I. Damgård, M. Geisler, M. Krøigaard, J.B. Nielsen, Asynchronous multiparty computation: Theory and implementation, in Public Key Cryptography (PKC09), LNCS, vol. 5443 (Springer, 2009), pp. 160-179, http://viff.dk.
70. I. Damgård, J.B. Nielsen, D. Wichs, Universally composable multiparty computation with partially isolated parties, in Theory of Cryptography (TCC'09), LNCS, vol. 5444 (Springer, 2009), pp. 315-331.
71. C. Demetrescu, I. Finocchi, G.F. Italiano, Algorithm engineering, algorithmics column. Bull. EATCS 79, 48-63 (2003).
72. N. Döttling, D. Kraschewski, J. Müller-Quade, Unconditional and composable security using a single stateful tamper-proof hardware token, in Theory of Cryptography (TCC'11), volume 6597 of LNCS, pages 164-181. Springer, 2011.
73. M. Dubovitskaya, A. Scafuro, I. Visconti, On efficient non-interactive oblivious transfer with tamper-proof hardware. Cryptology ePrint Archive, Report 2010/509, 2010, http://eprint.iacr.org/2010/509.
74. ECRYPT, II, Yearly report on algorithms and keysizes (2009-2010), March 2010, http://www.ecrypt.eu.org/documents/D.SPA.13.pdf.
75. T. El-Gamal, A public key cryptosystem and a signature scheme based on discrete logarithms, in Advances in Cryptology-CRYPTO'84, LNCS, vol. 196 (Springer, 1985), pp. 10-18.
76. Z. Erkin, M. Franz, J. Guajardo, S. Katzenbeisser, I. Lagendijk, T. Toft, Privacy-preserving face recognition, in Privacy Enhancing Technologies Symposium (PETS'09), LNCS, vol. 5672 (Springer, 2009), pp. 235-253.
77. J. Feigenbaum, B. Pinkas, R.S. Ryger, F. Saint-Jean, Secure computation of surveys, in EU Workshop on Secure Multiparty Protocols (SMP), ECRYPT, 2004.
78. M. Fischlin, A cost-effective pay-per-multiplication comparison method for millionaires, in Cryptographers' Track at RSA Conference (CT-RSA'01), LNCS, vol. 2020 (Springer, 2001), pp. 457-472.
79. M. Fischlin, B. Pinkas, A.-R. Sadeghi, T. Schneider, I. Visconti, Secure set intersection with untrusted hardware tokens, in Cryptographers' Track at the RSA Conference (CT-RSA'11), LNCS, vol. 6558 Springer, 14-18 Feb 2011, pp. 1-16.
80. M. Fort, F.C. Freiling, L.D. Penso, Z. Benenson, D. Kesdogan, Trustedpals: secure multiparty computation implemented with smart cards, in European Symposium on Research in Computer Security (ESORICS'06), LNCS, vol. 4189 (Springer, 2006) pp. 34-48.
81. M.J. Freedman, K. Nissim, B. Pinkas, Efficient private matching and set intersection, in Advances in Cryptology EUROCRYPT'04, LNCS, vol. 3027 (Springer, 2004), pp. 1-19.
82. K.B. Frikken, Practical private DNA string searching and matching through efficient oblivious automata evaluation, in Data and Applications Security (DBSec'09), LNCS, vol. 5645 (Springer, 2009), pp. 81-94.
83. K.B. Frikken, M.J. Atallah, J. Li, Hidden access control policies with hidden credentials, in ACM Workshop on Privacy in the Electronic Society (WPES'04), (ACM, 2004), p. 27.
84. K.B. Frikken, M.J. Atallah, C. Zhang, Privacy-preserving credit checking, in ACM Conference on Electronic Commerce, (ACM, 2005), pp. 147-154.
85. K.B. Frikken, M.J. Atallah, J. Li, Attribute-based access control with hidden policies and hidden credentials. IEEE Trans. Comput. 55(10), 1259-1270 (2006).
86. K.B. Frikken, J. Li, M.J. Atallah, Trust negotiation with hidden credentials, hidden policies, and policy cycles, in Network and Distributed System Security Symposium (NDSS'06), (The Internet Society, 2006), pp. 157-172.
87. K. Gandolfi, C. Mourtel, F. Olivier, Electromagnetic analysis: concrete results, in Cryptographic Hardware and Embedded Systems (CHES'01), LNCS, vol. 2162 (Springer, 2001), pp. 251-261.
88. J.A. Garay, P. MacKenzie, K. Yang, Efficient and universally composable committed oblivious transfer and applications, in Theory of Cryptography (TCC'04), LNCS, vol. 2951 (Springer, 2004), pp. 297-316.
89. J.A. Garay, B. Schoenmakers, J. Villegas, Practical and secure solutions for integer comparison, in Public Key Cryptography (PKC'07), LNCS, vol. 4450 (Springer, 2007), pp. 330-342.
90. J.A. Garay, V. Kolesnikov, R. McLellan, MAC precomputation with applications to secure memory, in Information Security Conference (ISC'09), LNCS, vol. 5735 (Springer, 2009), pp. 427-442.
91. R. Gennaro, C. Gentry, B. Parno, Non-interactive verifiable computing: outsourcing computation to untrusted workers, in Advances in Cryptology-CRYPTO'10, LNCS, vol. 6223 (Springer, 2010), pp. 465-482.
92. C. Gentry, A fully homomorphic encryption scheme. Ph.D. thesis, Stanford University, 2009, http://crypto.stanford.edu/craig.
93. C. Gentry, Fully homomorphic encryption using ideal lattices, in ACM Symposium on Theory of Computing (STOC'09), (ACM, 2009), pp. 169-178.
94. C. Gentry, S. Halevi, Implementing Gentry's fully-homomorphic encryption scheme, in LNCS, vol. 6632 (Springer, 2011), pp. 129-148.
95. C. Gentry, S. Halevi, V. Vaikuntanathan, A simple BGN-type cryptosystem from LWE, in Advances in Cryptology-EUROCRYPT'10, LNCS, vol. 6110 (Springer, 2010), pp. 506-522, http://eprint.iacr.org/2010/182.
96. D.Giry, J.-J.Quisquater, Cryptographic key length recommendation, 2010, http://keylength.com.
97. GMP-GNU multi precision arithmetic library, http://gmplib.org.
98. GMPY-multiprecision arithmetic for Python, http://code.google.com/p/gmpy.
99. O. Goldreich, Foundations of Cryptography, volume 2: Basic Applications (Cambridge University Press, New York, 2004), http://www.wisdom.weizmann.ac.il/oded/foc-vol2.html.
100. S. Goldwasser, S. Micali, Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270-299 (1984).
101. S. Goldwasser, Y.T. Kalai, G.N. Rothblum, One-time programs, in Advances in Cryptology-CRYPTO08, LNCS, vol. 5157 (Springer, 2008), pp. 39-56.
102. Google App Engine, https://appengine.google.com.
103. V. Goyal, P. Mohassel, A. Smith, Efficient two party and multi party computation against covert adversaries, in Advances in Cryptology-EUROCRYPT'08, LNCS, vol. 4965 (Springer, 2008), pp. 289-306.
104. V. Goyal, Y. Ishai, A. Sahai, R. Venkatesan, A. Wadia, Founding cryptography on tamperproof hardware tokens, in Theory of Cryptography (TCC'10), LNCS, vol. 5978 (Springer, 2010).
105. T.K. Grose, When surveillance cameras talk. Time Magazine, 11 Feb 2008, http://www.time.com/time/world/article/0, 8599, 1711972, 00.html.
106. V. Gunupudi, S.R. Tate, Generalized non-interactive oblivious transfer using count-limited objects with applications to secure mobile agents, in Financial Cryptography and Data Security (FC'08), LNCS, vol. 5143 (Springer, 2008), pp. 98-112.
107. J.A. Halderman, S.D. Schoen, N. Heninger, W. Clarkson, W. Paul, J.A. Calandrino, A.J. Feldman, J. Appelbaum, E.W. Felten, Lest we remember: cold boot attacks on encryption keys, in USENIX Security Symposium (Security'08), 2008, pp. 45-60.
108. C. Hazay, Y. Lindell, Constructions of truly practical secure protocols using standard smartcards, in ACM Conference on Computer and Communications Security (CCS'08), (ACM, 2008), pp. 491-500.
109. W. Henecka, S. Kögl, A.-R. Sadeghi, T. Schneider, I. Wehrenberg, TASTY: Tool for automating secure two-partY computations, in ACM Conference on Computer and Communications Security (CCS'10), 4-8 Oct 2010, pp. 451-462, http://eprint.iacr.org/2010/365.http://tastyproject.net.
110. A. Herzberg, H. Shulman, Secure guaranteed computation. Cryptology ePrint Archive, Report 2010/449, 2010, http://eprint.iacr.org/2010/449.
111. D. Hofheinz, J. Müller-Quade, D. Unruh, Universally composable zero-knowledge arguments and commitments from signature cards, in Central European Conference on Cryptology (MoraviaCrypt'05), 2005.
112. Y. Huang, D. Evans, J. Katz, L. Malka, Faster secure two-party computation using garbled circuits, in USENIX Security Symposium (Security'11), 2011, pp. 539-554.
113. Y. Huang, L. Malka, D. Evans, J. Katz, Efficient privacy-preserving biometric identification, in Network and Distributed System Security (NDSS'11), (The Internet Society, 2011), http://mightbeevil.org/secure-biometrics/.
114. Heise Security. Hacker extracts crypto key from TPM chip, 10 Feb 2010, http://www.h-online.com/security/news/item/Hacker-extracts-crypto-key-from-TPM-chip-927077.html.
115. IBM. IBM Cryptocards, http://www-03.ibm.com/security/cryptocards/.
116. A. Iliev, Hardware-Assisted Secure Computation. Ph.D. thesis, Dartmouth College, Hanover, NH, USA, 2009, http://www.cs.dartmouth.edu/trust/Faerieplay.
117. A. Iliev, S.W. Smith, More efficient secure function evaluation using tiny trusted third parties. Technical Report TR2005-551, Dartmouth College, Computer Science, Hanover, NH, July 2005.
118. A. Iliev, S.W. Smith, Faerieplay on tiny trusted third parties (work in progress), in Workshop on Advances in Trusted, Computing (WATC'06), 2006.
119. A. Iliev, S.W. Smith, Small, stupid, and scalable: secure computing with Faerieplay, in ACM Workshop on Scalable Trusted Computing (STC'10), (ACM, 2010), pp. 41-51.
120. International Civil Aviation Organization (ICAO), Machine Readable Travel Documents (MRTD), Doc 9303, Part 1, 5th edn., 2003.
121. Y. Ishai, J. Kilian, K. Nissim, E. Petrank, Extending oblivious transfers efficiently, in Advances in Cryptology-CRYPTO'03, LNCS, vol. 2729, (Springer, 2003), pp. 145-161.
122. Y. Ishai, A. Sahai, D. Wagner, Private circuits: securing hardware against probing attacks, in Advances in Cryptology-CRYPTO'03, LNCS, vol. 2729 (Springer, 2003), pp. 463-481.
123. Y. Ishai, M. Prabhakaran, A. Sahai, Founding cryptography on oblivious transfer- efficiently, in Advances in Cryptology-CRYPTO'08, LNCS, vol. 5157 (Springer, 2008), pp. 572-591.
124. Y. Ishai, E. Kushilevitz, R. Ostrovsky, M. Prabhakaran, A. Sahai, Efficient non-interactive secure computation, in Advances in Cryptology-EUROCRYPT'11, LNCS, vol. 6632 (Springer, 2011), pp. 406-425.
125. S. Jarecki, V. Shmatikov, Efficient two-party secure computation on committed inputs, in Advances in Cryptology-EUROCRYPT'07, LNCS, vol. 4515 (Springer, 2007), pp. 97-114.
126. A. Jarrous, B. Pinkas, Secure Hamming distance based computation and its applications, in Applied Cryptography and Network Security (ACNS'09), LNCS, vol. 5536 (Springer, 2009), pp. 107-124.
127. K. Järvinen, V. Kolesnikov, A.-R. Sadeghi, T. Schneider, Efficient secure two-party computation with untrusted hardware tokens, in Towards Hardware Intrinsic Security: Foundation and Practice, Information Security and Cryptography, ed. by A.-R. Sadeghi, D. Naccache, (Springer-Verlag, Berlin 2010), pp. 367-386.
128. K. Järvinen, V. Kolesnikov, A.-R. Sadeghi, T. Schneider, Embedded SFE: offloading server and network using hardware tokens, in International Conference on Financial Cryptography and Data Security (FC'10), LNCS, vol. 6052, Springer, 25-28 January 2010, pp. 207-221, http://eprint.iacr.org/2009/591.
129. K. Järvinen, V. Kolesnikov, A.-R. Sadeghi, T. Schneider, Garbled circuits for leakageresilience: hardware implementation and evaluation of one-time programs, in International Workshop on Cryptographic Hardware and Embedded Systems (CHES10), LNCS, vol. 6225, Springer, 1720 Aug 2010, pp. 383-397, http://eprint.iacr.org/2010/276.
130. S. Jiang, S. Smith, K. Minami, Securing web servers against insider attack, in Annual Computer Security Applications Conference (ACSAC'01), IEEE, 2001, pp. 265-276.
131. D.B. Johnson, A.J. Menezes, S. Vanstone, The elliptic curve digital signature algorithm (ECDSA). Int. J. Inf. Secur. 1(1), 36-63 (2001).
132. V. Kabanets, J.-Y. Cai, Circuit minimization problem, in ACM Symposium on Theory of Computing (STOC'00), (ACM, 2000), pp. 73-79.
133. S. Kamara, K. Lauter, Cryptographic cloud storage, in Financial Cryptography Workshops: Real-Life Cryptographic Protocols and Standardization (RLCPS'10), LNCS, vol. 6054 (Springer, 2010), pp. 136-149.
134. A.A. Karatsuba, Y. Ofman, Multiplication of many-digital numbers by automatic computers. SSSR Acad. Sci. 145, 293-294 (1962).
135. J. Katz, Universally composable multi-party computation using tamper-proof hardware, in Advances in Cryptology-EUROCRYPT'07, LNCS, vol. 4515 (Springer, 2007), pp. 115-128.
136. J. Katz, L. Malka, Private function evaluation with linear complexity, in Advances in Cryptology-ASIACRYPT'11, LNCS, vol. 7073, (Springer, 2011), pp. 556-571.
137. J. Kelsey, B. Schneier, D. Wagner, C. Hall, Side channel cryptanalysis of product ciphers, in European Sumposium on Research in Computer Security (ESORICS'98), LNCS, vol. 1485 (Springer, 1998), pp. 97-110.
138. M.S. Kiraz, B. Schoenmakers, A protocol issue for the malicious case of Yao's garbled circuit construction, in Symposium on Information Theory in the Benelux, 2006, pp. 283-290.
139. P.C. Kocher, J. Jaffe, B. Jun, Differential power analysis, in Advances in Cryptology- CRYPTO'99, LNCS, vol. 1666 (Springer, 1999), pp. 388-397.
140. V. Kolesnikov, Gate evaluation secret sharing and secure one-round two-party computation, in Advances in Cryptology-ASIACRYPT'05, LNCS, vol. 3788 (Springer, 2005), pp. 136-155.
141. V. Kolesnikov, Truly efficient string oblivious transfer using resettable tamper-proof tokens, in Theory of Cryptography Conference (TCC'10), LNCS, vol. 5978 (Springer, 2010), pp. 327-342.
142. V. Kolesnikov, T. Schneider, Improved garbled circuit: free XOR gates and applications, in nternational Colloquium on Automata, Languages and Programming (ICALP'08), LNCS, vol. 5126 Springer, 6-13 July 2008, pp. 486-498.
143. V. Kolesnikov, T. Schneider, A practical universal circuit construction and secure evaluation of private functions, in International Conference on Financial Cryptography and Data Security (FC'08), LNCS, vol. 5143, Springer, 28-31 Jan 2008, pp. 83-97, http://thomaschneider.de/FairplayPF.
144. V. Kolesnikov, A.-R. Sadeghi, T. Schneider, Improved garbled circuit building blocks and applications to auctions and computing minima, in International Conference on Cryptology and Network Security (CANS'09), LNCS vol. 5888, Springer, 12-14 Dec 2009, pp. 1-20, http://eprint.iacr.org/2009/411.
145. V. Kolesnikov, A.-R. Sadeghi, T. Schneider, From dust to dawn: practically efficient twoparty secure function evaluation protocols and their modular design. Cryptology ePrint Archive, Report 2010/079, 2010, http://eprint.iacr.org/2010/079.
146. H. Krawczyk, M. Bellare, R. Canetti, HMAC: keyed-hashing for message authentication. RFC 2104 (Informational), Feb 1997, http://tools.ietf.org/html/rfc2104.
147. L. Kruger, S. Jha, E.-J. Goh, D. Boneh, Secure function evaluation with ordered binary decision diagrams, in ACM Computer and Communications Security (CCS'06), (ACM, 2006), pp. 410-420.
148. K. Lauter, Mi. Naehrig, V. Vaikuntanathan, Can homomorphic encryption be practical?, in ACM Cloud Computing Security Workshop (CCSW'11), (ACM, 2011), pp. 113-124.
149. K. Lemke, Embedded security: physical protection against tampering attacks, in Embedded Security in Cars, Chapter 2, ed. by K. Lemke, C. Paar, M. Wolf (Springer, Berlin, 2006), pp. 207-217.
150. Y. Lindell, B. Pinkas, An efficient protocol for secure two-party computation in the presence of malicious adversaries, in Advances in Cryptology-EUROCRYPT'07, LNCS, vol. 4515 (Springer, 2007), pp. 52-78.
151. Y. Lindell, B. Pinkas, A proof of Yao's protocol for secure two-party computation. J. Cryptol. 22(2), 161-188, 2009, http://eprint.iacr.org/2004/175.
152. Y. Lindell, B. Pinkas, Secure multiparty computation for privacy-preserving data mining. J. Priv. Confid. 1(1), 59-98 (2009).
153. Y. Lindell, B. Pinkas, Secure two-party computation via cut-and-choose oblivious transfer, in Theory of Cryptography (TCC11), LNCS, vol. 6597 (Springer, 2011), pp. 329-346.
154. Y. Lindell, B. Pinkas, N.P. Smart, Implementing two-party computation efficiently with security against malicious adversaries, in Security and Cryptography for Networks (SCN'08), LNCS, vol. 5229 (Springer, 2008), pp. 2-20.
155. P.D. MacKenzie, A. Oprea, M.K. Reiter, Automatic generation of two-party computations, in ACM Conference on Computer and Communications Security (CCS'03), (ACM, 2003), pp. 210-219.
156. L. Malka, VMCrypt-modular software architecture for scalable secure computation, in ACM Conference on Computer and Communications Security (CCS'11), (ACM, 2011), pp. 715-724.
157. D. Malkhi, N. Nisan, B. Pinkas, Y. Sella, Fairplay-a secure two-party computation system, in USENIX Security Symposium (Security'04), 2004, pp. 287-302, http://fairplayproject.net/fairplay.html.
158. S. Meiklejohn, C. Erway, A. Küpçü, T. Hinkle, A. Lysyanskaya, ZKPDL: A language-based system for efficient zero-knowledge proofs and electronic cash, in USENIX Security Symposium (Security'10), 2010, pp. 193-206.
159. Microsoft SQL Azure, http://www.microsoft.com/windowsazure.
160. T. Moran, The Qilin crypto SDK-an open-source Java SDK for rapid prototyping of cryptographic protocols, http://qilin.seas.harvard.edu.
161. T. Moran, G. Segev, David and Goliath commitments: UC computation for asymmetric parties using tamper-proof hardware, in Advances in Cryptology-EUROCRYPT'08, LNCS, vol. 4965 (Springer, 2008), pp. 527-544.
162. I. Naumann, G. Hogben, Privacy features of European eID card specifications. Netw. Secur. 2008(8), 9-13 (2008), (European Network and Information, Security Agency (ENISA)).
163. M. Naor, B. Pinkas, Efficient oblivious transfer protocols, in ACM-SIAM Symposium On Discrete Algorithms (SODA'01), (Society for Industrial and, Applied Mathematics, 2001), pp. 448-457.
164. M. Naor, B. Pinkas, R. Sumner, Privacy preserving auctions and mechanism design, in ACM Conference on Electronic Commerce, (ACM, 1999), pp. 129-139.
165. E.M. Newton, L. Sweeney, B. Malin, Preserving privacy by de-identifying face images. IEEE Trans. Knowl. Data Eng. 17(2), 232-243 (2005).
166. J.B. Nielsen, Extending oblivious transfers efficiently-how to get robustness almost for free. Cryptology ePrint Archive, Report 2007/215, 2007, http://eprint.iacr.org/2007/215.
167. J.D. Nielsen, Languages for secure multiparty computation and towards strongly typed macros. Ph.D. thesis, University of Aarhus, Denmark, 2009.
168. J.B. Nielsen, C. Orlandi, LEGO for two-party secure computation, in Theory of Cryptography (TCC'09), LNCS, vol. 5444 (Springer, 2009), pp. 368-386.
169. J.D. Nielsen, M.I. Schwartzbach, A domain-specific programming language for secure multiparty computation, in Workshop on Programming Languages and Analysis for Security (PLAS'07), (ACM, 2007), pp. 21-30.
170. NIST, U.S. National Institute of Standards and Technology. Federal Information Processing Standards (FIPS 197). Advanced Encryption Standard (AES), Nov 2001, http://csrc.nist.gov/publications/fips/fips197/fips-197.pdf.
171. NIST, U.S. National Institute of Standards and Technology. Federal Information Processing Standards (FIPS 180-2). Announcing the Secure Hash Standard, Aug 2002, http://csrc.nist.gov/publications/fips/fips180-2/fips180-2.pdf.
172. J. Nzouonta, M.C. Silaghi, M. Yokoo, Secure computation for combinatorial auctions and market exchanges, in Autonomous Agents and Multiagent Systems (AAMAS'04), (IEEE, 2004), pp. 1398-1399.
173. M. Osadchy, B. Pinkas, A. Jarrous, B. Moskovich, SCiFI-a system for secure face identification, in IEEE Symposium on Security and Privacy (S&P'10), (IEEE, 2010), pp. 239-254.
174. D.A. Osvik, A. Shamir, E. Tromer, Cache attacks and countermeasures: The case of AES, in Cryptographers' Track at-RSA Conference (CT-RSA'06), LNCS, vol. 3860 (Springer, 2006), pp. 1-20.
175. D. Page, Theoretical use of cache memory as a cryptanalytic side-channel. Technical Report CSTR-02-003, University of Bristol, 2002.
176. P. Paillier, Public-key cryptosystems based on composite degree residuosity classes, in Advances in Cryptology-EUROCRYPT'99, LNCS, vol. 1592 (Springer, 1999), pp. 223-238.
177. A. Paus, A.-R. Sadeghi, T. Schneider, Practical secure evaluation of semi-private functions, in International Conference on Applied Cryptography and Network Security (ACNS'09), LNCS, vol. 5536 Springer, 2-5 June 2009, pp. 89-106, http://www.trust.rub.de/FairplaySPF., http://eprint.iacr.org/2009/124.
178. T.P. Pedersen, Non-interactive and information-theoretic secure verifiable secret sharing, in Advances in Cryptology-CRYPTO'91, LNCS, vol. 576 (Springer, 1992), pp. 129-140.
179. K. Pietrzak, Provable security for physical cryptography, in Western European Workshop on Research in Cryptology (WEWoRC'09), 2009, http://homepages.cwi.nl/pietrzak/publications/Pie09b.pdf.
180. B. Pinkas, T. Schneider, N.P. Smart, S.C. Williams, Secure two-party computation is practical, in Advances in Cryptology-ASIACRYPT 2009, LNCS, vol. 5912 Springer, 6-10 Dec 2009, http://eprint.iacr.org/2009/314.
181. Python programming language-official website, http://www.python.org.
182. J.-J. Quisquater, D. Samyde, Electromagnetic analysis (EMA): measures and countermeasures for smart cards, in Research in Smart Cards (E-smart'01), LNCS, vol. 2140 (Springer, 2001), pp. 200-210.
183. R.L. Rivest, A. Shamir, L.M. Adleman, A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120-126 (1978).
184. A.-R. Sadeghi, T. Schneider, Generalized universal circuits for secure evaluation of private functions with application to data classification, in International Conference on Information Security and Cryptology (ICISC'08), LNCS, vol. 5461 Springer, 3-5 Dec 2008, pp. 336-353, http://eprint.iacr.org/2008/453.
185. A.-R. Sadeghi, T. Schneider, Ask your e-doctor without telling: Privacy-preserving medical diagnostics. Section Days of Ruhr-University Bochum Research School, 6 Nov 2009 (Poster prize awarded).
186. A.-R. Sadeghi, T. Schneider, Verschlüsselt Rechnen: Sichere Verarbeitung verschlüsselter medizinischer Daten am Beispiel der Klassifikation von EKG-Daten, in Workshop Innovative und sichere Informationstechnologie für das Gesundheitswesen von morgen (perspeGKtive'10), LNI, vol. P-174 Bonner Köllen Verlag, 8 Sept 2010, pp. 11-25.
187. A.-R. Sadeghi, C. Wachsmann, Trusted computing, In Handbook of Financial Cryptography and Security (CRC Press, 2010), pp. 221-256.
188. A.-R. Sadeghi, C. Stüble, M. Winandy, Property-based TPM virtualization, in Information Security Conference (ISC'08), LNCS, vol. 5222 (Springer, 2008), pp. 1-16.
189. A.-R. Sadeghi, T. Schneider, I. Wehrenberg, Efficient privacy-preserving face recognition, in International Conference on Information Security and Cryptology (ICISC'09), LNCS, vol. 5984, Springer, 2-4 Dec 2009, pp. 229-244, http://eprint.iacr.org/2009/507.
190. A.-R. Sadeghi, T. Schneider, M. Winandy, Token-based cloud computing-secure outsourcing of data and arbitrary computations with lower latency, in International Conference on Trust and Trustworthy Computing (TRUST'10)-Workshop on Trust in the Cloud, LNCS, vol. 6101 Springer, 21-23 June 2010, pp. 417-429.
191. P. Sanders, Algorithm engineering-an attempt at a definition, in Efficient Algorithms, LNCS, vol. 5760 (Springer, 2009), pp. 321-340.
192. T. Sander, C. Tschudin, Protecting mobile agents against malicious hosts, in Mobile Agents and Security, LNCS, vol. 1419 (Springer, 1998), pp. 44-60.
193. T. Sander, A. Young, M. Yung, Non-interactive cryptocomputing for NC1, in IEEE Symposium on Foundations of Computer Science (FOCS'99), (IEEE, 1999), pp. 554-566.
194. T. Schneider, Practical secure function evaluation. Master's thesis, University Erlangen- Nürnberg, Germany, 27 Feb 2008, http://thomaschneider.de/theses/da/.
195. A. Schröpfer, F. Kerschbaum, D. Biswas, S. Geißinger, C. Schütz, L1-faster development and benchmarking of cryptographic protocols, in ECRYPT Workshop on Software Performance Enhancements for Encryption and Decryption and Cryptographic Compilers (SPEED-CC'09), 12-13 Oct 2009.
196. A. Schröpfer, F. Kerschbaum, G. Müller, L1-an intermediate language for mixed-protocol secure computation, in IEEE Computer Software and Applications Conference (COMPSAC'11), (IEEE, 2011), pp. 298-307.
197. A. Shamir, How to share a secret. Commun. ACM 22(11), 612-613 (1979).
198. C.E. Shannon, The synthesis of two-terminal switching circuits. Bell Syst. Techn. J. 28(1), 5998 (1949).
199. M.C. Silaghi, SMC: secure multiparty computation language, http://cs.fit.edu/msilaghi/pages/SMC/, 2004.
200. S.P. Skorobogatov, Data remanence in flash memory devices, in Cryptographic Hardware and Embedded Systems (CHES05), LNCS, vol. 3659 (Springer, 2005), pp. 339-353.
201. N.P. Smart, F. Vercauteren, Fully homomorphic encryption with relatively small key and ciphertext sizes, in Public Key Cryptography (PKC'10), LNCS, vol. 6056 (Springer, 2010), pp. 420-443.
202. S.W. Smith, Fairy dust, secrets, and the real world. IEEE Secur. Priv. 1(1), 89-93 (2003).
203. S.W. Smith, S. Weingart, Building a high-performance, programmable secure coprocessor. Comput. Netw. 31(8), 831-860 (1999), (Special Issue on Computer Network Security).
204. J. Song, R. Poovendran, J. Lee, T. Iwata, The AES-CMAC Algorithm. RFC 4493 (Informational), June 2006, http://tools.ietf.org/html/rfc4493.
205. Y.N. Srikant, P. Shankar (eds.) The Compiler Design Handbook: Optimizations and Machine Code Generation (CRC Press, New York, 2002).
206. F.-X. Standaert, O. Pereira, Y. Yu, J.-J. Quisquater, M. Yung, E. Oswald, Leakage resilient cryptography in practice. Cryptology ePrint Archive, Report 2009/341, 2009, http://eprint.iacr.org/2009/341.
207. Standards for efficient cryptography, SEC 2: Recommended elliptic curve domain parameters. Technical report, Certicom Research, 2000, http://www.secg.org/download/aid-784/sec2-v2.pdf.
208. D. Stehlé, R. Steinfeld, Faster fully homomorphic encryption, in Advances in Cryptology- ASIACRYPT'10, LNCS, vol. 6477 (Springer, 2010), pp. 377-394.
209. M. Stevens, A. Sotirov, J. Appelbaum, A.K. Lenstra, D. Molnar, D.A. Osvik, B. de Weger. Short chosen-prefix collisions for MD5 and the creation of a rogue CA certificate, in Advances in Cryptology-CRYPTO'09, LNCS, vol. 5677 (Springer, 2009), pp. 55-69.
210. STMicroelectronics. Smartcard MCU with 32-bit ARM SecurCore SC300 CPU and 1.25 Mbytes high-density Flash memory. Data brief, Oct 2008, http://www.st.com/internet/mcu/product/215291.jsp.
211. S.R. Tate, R. Vishwanathan, Improving cut-and-choose in verifiable encryption and fair exchange protocols using trusted computing technology, in Data and Applications Security (DBSec'09), LNCS, vol. 5645 (Springer, 2009), pp. 252-267.
212. S.R. Tate, K. Xu, Mobile agent security through multi-agent cryptographic protocols, in International Conference on Internet Computing (IC'03), (CSREA Press, 2003), pp. 462-470.
213. S.R. Tate, K. Xu, On garbled circuits and constant round secure function evaluation. Technical Report 2003-02, CoPS Labi, 2003.
214. K. Tiri, D. Hwang, A. Hodjat, B.-C. Lai, S. Yang, P. Schaumont, I. Verbauwhede, Prototype IC with WDDL and differential routing-DPA resistance assessment, in Cryptographic Hardware and Embedded Systems (CHES'05), LNCS, vol. 3659 (Springer, 2005), pp. 354-365.
215. J.R. Troncoso-Pastoriza, S. Katzenbeisser, M.U. Celik, Privacy preserving error resilient DNA searching through oblivious automata, in ACM Computer and Communications Security (CCS'07), (ACM, 2007), pp. 519-528.
216. Trusted Computing Group (TCG). TPM main specification. Main specification, Trusted Computing Group, May 2009, http://www.trustedcomputinggroup.org.
217. M.A. Turk, A.P. Pentland, Eigenfaces for recognition. J. Cogn. Neurosci. 3(1), 71-86 (1991).
218. M.A. Turk, A.P. Pentland, Face recognition using eigenfaces, in IEEE Computer Vision and Pattern Recognition (CVPR'91), (IEEE, 1991), pp. 586-591.
219. B.C.H. Turton, Extending quine-mccluskey for exclusive-or logic synthesis. IEEE Trans. Educat. 39, 81-85 (1996).
220. P. Tuyls, A. H.M. Akkermans, T.A.M. Kevenaar, G.-J. Schrijen, A.M. Bazen, R.N.J. Veldhuis, Practical biometric authentication with template protection, in Audio- And Video-Based Biometric Person Authentication, LNCS, vol. 3546 (Springer, 2005), pp. 436-446.
221. L.G. Valiant, Universal circuits (preliminary report), in ACM Symposium on Theory of Computing (STOC'76), (ACM, 1976), pp. 196-203.
222. M. van Dijk, A. Juels, On the impossibility of cryptography alone for privacy-preserving cloud computing, in USENIX Workshop on Hot Topics in Security (HotSec'10), 2010.
223. M. van Dijk, C. Gentry, S. Halevi, V. Vaikuntanathan. Fully homomorphic encryption over the integers, in Advances in Cryptology-EUROCRYPT'10, LNCS, vol. 6110 (Springer, 2010), pp. 24-43.
224. I. Verbauwhede, P. Schaumont, Design methods for security and trust, in Design, Automation and Test in Europe (DATE'07), (ACM, 2007), pp. 672-677.
225. H. Vollmer, Introduction to Circuit Complexity: A Uniform Approach (Springer, Berlin, 1999).
226. X. Wang, Y.L. Yin, H. Yu. Finding collisions in the full SHA-1, in Advances in Cryptology-CRYPTO'05, LNCS vol. 3621 (Springer, 2005), pp. 17-36.
227. S.H. Weingart, Physical security devices for computer subsystems: A survey of attacks and defences, in Cryptographic Hardware and Embedded Systems (CHES'00), LNCS, vol. 1965 (Springer, 2000), pp. 302-317.
228. P. Woelfel, Bounds on the OBDD-size of integer multiplication via universal hashing. J. Comput. Syst. Sci. 71(4), 520-534 (2005).
229. K. Xu, S.R. Tate, Universally composable secure mobile agent computation, in Information Security Conference (ISC04), LNCS, vol. 3225 (Springer, 2004), pp. 304-317.
230. A.C. Yao, Protocols for secure computations, in IEEE Symposium on Foundations of Computer Science (FOCS'82), (IEEE, 1982), pp. 160-164.
231. A.C. Yao, How to generate and exchange secrets, in IEEE Symposium on Foundations of Computer Science (FOCS'86), (IEEE, 1986), pp. 162-167.
232. B.S. Yee, Using Secure Coprocessors, PhD thesis, School of Computer Science, Carnegie Mellon University, May 1994. CMU-CS-94-149.
233. Y. Yu, J. Leiwo, B. Premkumar, Securely utilizing external computing power, in International Symposium on Information Technology: Coding and Computing (ITCC'05), vol. 1 (IEEE Computer Society, 2005), pp. 762-767.
234. Y. Yu, J. Leiwo, B. Premkumar, On developing privacy-preserving compilers. Int. J. Comput. Sci. Netw. Secur. (IJCSNS) 6(3), 154-160 (2006).