[1]

B. Adida, D. Wikström, How to shuffle in public, in *TCC 2007*, ed. by S.P. Vadhan. Amsterdam, The Netherlands, February 21–24, 2007. LNCS, vol. 4392 (Springer, Berlin, 2007), pp. 555–574

[2]

M. Backes, B. Pfitzmann, M. Waidner, A composable cryptographic library with nested operations, in

*ACM CCS 03*, ed. by S. Jajodia, V. Atluri, T. Jaeger. Washington DC, USA, October 27–30, 2003 (ACM Press, New York, 2003), pp. 220–230

CrossRef[3]

B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S.P. Vadhan, K. Yang, On the (im)possibility of obfuscating programs, in *CRYPTO 2001*, ed. by J. Kilian. Santa Barbara, CA, USA, August 19–23, 2001. LNCS, vol. 2139 (Springer, Berlin, 2001), pp. 1–18

[4]

D. Beaver, Foundations of secure interactive computing, in *CRYPTO’91*, ed. by J. Feigenbaum. Santa Barbara, CA, USA, August 11–15, 1992. LNCS, vol. 576 (Springer, Berlin, 1992), pp. 377–391

[5]

M. Bellare, C. Namprempre, Authenticated encryption: Relations among notions and analysis of the generic composition paradigm, in

*ASIACRYPT 2000*, ed. by T. Okamoto. Kyoto, Japan, December 3–7, 2000. LNCS, vol. 1976 (Springer, Berlin, 2000), pp. 531–545

CrossRef[6]

M. Bellare, A. Desai, E. Jokipii, P. Rogaway, A concrete security treatment of symmetric encryption, in *38th FOCS*. Miami Beach, Florida, October 19–22, 1997 (IEEE Computer Society, Los Alamitos, 1997), pp. 394–403

[7]

M. Bellare, A. Boldyreva, A. O’Neill, Deterministic and efficiently searchable encryption, in

*CRYPTO 2007*, ed. by A. Menezes. Santa Barbara, CA, USA, August 19–23, 2007. LNCS, vol. 4622 (Springer, Berlin, 2007), pp. 535–552

CrossRef[8]

R. Canetti, Towards realizing random oracles: Hash functions that hide all partial information, in *CRYPTO’97*, ed. by B.S. Kaliski Jr. Santa Barbara, CA, USA, August 17–21, 1997. LNCS, vol. 1294 (Springer, Berlin, 1997), pp. 455–469

[9]

R. Canetti, Universally composable security: A new paradigm for cryptographic protocols, in *42nd FOCS*. Las Vegas, Nevada, USA, October 14–17, 2001 (IEEE Computer Society, Los Alamitos, 2001), pp. 136–145

[10]

R. Canetti, D. Micciancio, O. Reingold, Perfectly one-way probabilistic hash functions (preliminary version), in *30th ACM STOC*. Dallas, Texas, USA, May 23–26, 1998 (ACM Press, New York, 1998), pp. 131–140

[11]

W. Diffie, M.E. Hellman, New directions in cryptography.

*IEEE Trans. Inf. Theory*
**22**(6), 644–654 (1976)

MATHCrossRefMathSciNet[12]

Y. Dodis, A. Smith, Correcting errors without leaking partial information, in *37th ACM STOC*, ed. by H.N. Gabow, R. Fagin. Baltimore, Maryland, USA, May 22–24, 2005 (ACM Press, New York, 2005), pp. 654–663

[13]

O. Goldreich, R. Ostrovsky, Software protection and simulation of oblivious rams.

*J. ACM*
**43**(3), 431–473 (1996)

MATHCrossRefMathSciNet[14]

O. Goldreich, S. Goldwasser, S. Micali, How to construct random functions.

*J. ACM*
**33**, 792–807 (1986)

CrossRefMathSciNet[15]

O. Goldreich, S. Micali, A. Wigderson, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems.

*J. ACM*
**38**(3), 691–729 (1991)

MATHCrossRefMathSciNet[16]

S. Goldwasser, Y. Tauman Kalai, On the impossibility of obfuscation with auxiliary input, in *46th FOCS*. Pittsburgh, PA, USA, October 23–25, 2005 (IEEE Computer Society, Los Alamitos, 2005), pp. 553–562

[17]

S. Goldwasser, S. Micali, Probabilistic encryption.

*J. Comput. Syst. Sci.*
**28**(2), 270–299 (1984)

MATHCrossRefMathSciNet[18]

S. Goldwasser, G.N. Rothblum, On best-possible obfuscation, in *TCC 2007*, ed. by S.P. Vadhan. Amsterdam, The Netherlands, February 21–24, 2007. LNCS, vol. 4392 (Springer, Berlin, 2007), pp. 194–213

[19]

S. Hada, Zero-knowledge and code obfuscation, in

*ASIACRYPT 2000*, ed. by T. Okamoto. Kyoto, Japan, December 3–7, 2000. LNCS, vol. 1976 (Springer, Berlin, 2000), pp. 443–457

CrossRef[20]

D. Hofheinz, D. Unruh, Simulatable security and polynomially bounded concurrent composability, in

*2006 IEEE Symposium on Security and Privacy*. Berkeley, California, USA, May 21–24, 2006 (IEEE Computer Society, Los Alamitos, 2006), pp. 169–183

CrossRef[21]

D. Hofheinz, J. Malone-Lee, M. Stam, Obfuscation for cryptographic purposes, in *TCC 2007*, ed. by S.P. Vadhan. Amsterdam, The Netherlands, February 21–24, 2007. LNCS, vol. 4392 (Springer, Berlin, 2007), pp. 214–232

[22]

S. Hohenberger, G.N. Rothblum, Abhi Shelat, V. Vaikuntanathan, Securely obfuscating re-encryption, in *TCC 2007*, ed. by S.P. Vadhan. Amsterdam, The Netherlands, February 21–24, 2007. LNCS, vol. 4392 (Springer, Berlin, 2007), pp. 233–252

[23]

R. Jaeschke, Encrypting C source for distribution. *J. C Lang. Trans.*
**2**(1) 1990

[24]

J. Katz, M. Yung, Complete characterization of security notions for probabilistic private-key encryption, in *32nd ACM STOC*. Portland, Oregon, USA, May 21–23, 2000 (ACM Press, New York, 2000), pp. 245–254

[25]

C. Linn, S.K. Debray, Obfuscation of executable code to improve resistance to static disassembly, in

*ACM CCS 03*, ed. by S. Jajodia, V. Atluri, T. Jaeger. Washington D.C., USA, October 27–30, 2003 (ACM Press, New York, 2003), pp. 290–299

CrossRef[26]

B. Lynn, M. Prabhakaran, A. Sahai, Positive results and techniques for obfuscation, in *EUROCRYPT 2004*, ed. by C. Cachin, J. Camenisch. Interlaken, Switzerland, May 2–6, 2004. LNCS, vol. 3027 (Springer, Berlin, 2004), pp. 20–39

[27]

U.M. Maurer, R. Renner, C. Holenstein, Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology, in *TCC 2004*, ed. by M. Naor. Cambridge, MA, USA, February 19–21, 2004. LNCS, vol. 2951 (Springer, Berlin, 2004), pp. 21–39

[28]

S. Micali, P. Rogaway, Secure computation (abstract), in *CRYPTO’91*, ed. by J. Feigenbaum. Santa Barbara, CA, USA, August 11–15, 1992. LNCS, vol. 576 (Springer, Berlin, 1992), pp. 392–404

[29]

M. Naor, M. Yung, Public-key cryptosystems provably secure against chosen ciphertext attacks, in *22nd ACM STOC*. Baltimore, Maryland, USA, May 14–16, 1990 (ACM Press, New York, 1990)

[30]

A. Narayanan, V. Shmatikov, Stronger security of authenticated key exchange. Cryptology ePrint Archive, Report 2006/182 (2006).

http://eprint.iacr.org/
[31]

R. Ostrovsky, W.E. Skeith III, Private searching on streaming data, in *CRYPTO 2005*, ed. by V. Shoup. Santa Barbara, CA, USA, August 14–18, 2005. LNCS, vol. 3621 (Springer, Berlin, 2005), pp. 223–240

[32]

C. Rackoff, D.R. Simon, Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack, in *CRYPTO’91*, ed. by J. Feigenbaum. Santa Barbara, CA, USA, August 11–15, 1992. LNCS, vol. 576 (Springer, Berlin, 1992), pp. 433–444

[33]

J. Rompel, One-way functions are necessary and sufficient for secure signatures, in *22nd ACM STOC*. Baltimore, Maryland, USA, May 14–16, 1990 (ACM Press, New York, 1990), pp. 387–394

[34]

H. Wee, On obfuscating point functions, in *37th ACM STOC*, ed. by H.N. Gabow, R. Fagin. Baltimore, Maryland, USA, May 22–24, 2005 (ACM Press, New York, 2005), pp. 523–532