-
1
-
-
2342586295
-
ISO/IEC 7816-2 information technology - Identification cards - Integrated circuit(s) cards with contacts
-
ISO/IEC 7816-2 Information Technology - Identification Cards - Integrated Circuit(s) Cards with Contacts, 1999. Part 2: Dimensions and location of the contacts.
-
(1999)
Part 2: Dimensions and Location of the Contacts
-
-
-
2
-
-
0025230154
-
Secure circuit evaluation: A protocol based on hiding information from an oracle
-
M. Abadi and J. Feigenbaum. Secure circuit evaluation: A protocol based on hiding information from an oracle. J. Cryptol.2, pages 1-12, 1990.
-
(1990)
J. Cryptol.
, vol.2
, pp. 1-12
-
-
Abadi, M.1
Feigenbaum, J.2
-
4
-
-
79251578513
-
On the (im)possibility of obfuscating programs
-
B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (im)possibility of obfuscating programs. LNCS, 2139:1-18, 2001.
-
(2001)
LNCS
, vol.2139
, pp. 1-18
-
-
Barak, B.1
Goldreich, O.2
Impagliazzo, R.3
Rudich, S.4
Sahai, A.5
Vadhan, S.6
Yang, K.7
-
5
-
-
0029702967
-
Correlated pseudorandomness and the complexity of private computations
-
D. Beaver. Correlated pseudorandomness and the complexity of private computations. In Proc. 28th Annual STOC, pages 479-488, 1996.
-
(1996)
Proc. 28th Annual STOC
, pp. 479-488
-
-
Beaver, D.1
-
6
-
-
0025137207
-
The round complexity of secure protocols
-
ACM Press
-
D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols. In Proc. 22th Annual STOC, pages 503-513. ACM Press, 1990.
-
(1990)
Proc. 22th Annual STOC
, pp. 503-513
-
-
Beaver, D.1
Micali, S.2
Rogaway, P.3
-
7
-
-
0023545076
-
How to play any mental game or a completeness theorem for protocols with honest majority
-
O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In Proc. 19th Annual STOC, pages 218-229, 1987.
-
(1987)
Proc. 19th Annual STOC
, pp. 218-229
-
-
Goldreich, O.1
Micali, S.2
Wigderson, A.3
-
9
-
-
24744472288
-
A proof of yao's protocol for secure two-party computation
-
Y. Lindell and B. Pinkas. A proof of yao's protocol for secure two-party computation. Cryptology ePrint Archive, 2004. http://eprint.iacr.org/2004/175.
-
(2004)
Cryptology EPrint Archive
-
-
Lindell, Y.1
Pinkas, B.2
-
10
-
-
0344087860
-
-
PhD thesis, Ecole Nationale Superieure des Telecommunication
-
S. Loureiro. Mobile Code Protection. PhD thesis, Ecole Nationale Superieure des Telecommunication, 2001.
-
(2001)
Mobile Code Protection
-
-
Loureiro, S.1
-
14
-
-
0003197918
-
Protecting mobile agents against malicious hosts
-
T. Sander and C. F. Tschudin. Protecting mobile agents against malicious hosts. In Mobile Agents and Security, LNCS, volume 1419, pages 44-60, 1998.
-
(1998)
Mobile Agents and Security, LNCS
, vol.1419
, pp. 44-60
-
-
Sander, T.1
Tschudin, C.F.2
-
16
-
-
1842599266
-
On garbled circuits and constant round secure function evaluation
-
CoPS Lab
-
S. R. Tate and K. Xu. On garbled circuits and constant round secure function evaluation. Technical report, CoPS Lab, 2003.
-
(2003)
Technical Report
-
-
Tate, S.R.1
Xu, K.2
|