-
1
-
-
84945134014
-
Priced oblivious transfer: How to sell digital goods
-
Pfitzmann, B, ed, EUROCRYPT 2001, Springer, Heidelberg
-
Aiello, W., Ishai, Y., Reingold, O.: Priced oblivious transfer: How to sell digital goods. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 119-135. Springer, Heidelberg (2001)
-
(2001)
LNCS
, vol.2045
, pp. 119-135
-
-
Aiello, W.1
Ishai, Y.2
Reingold, O.3
-
2
-
-
35048887476
-
Short Group Signatures
-
Franklin, M, ed, CRYPTO 2004, Springer, Heidelberg
-
Boneh, D., Boyen, X., Shacham, H.: Short Group Signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 41-55. Springer, Heidelberg (2004)
-
(2004)
LNCS
, vol.3152
, pp. 41-55
-
-
Boneh, D.1
Boyen, X.2
Shacham, H.3
-
3
-
-
17744381610
-
Universally composable protocols with relaxed set-up assumptions. In: FOCS
-
Los Alamitos
-
Barak, B., Canetti, R., Nielsen, J.B., Pass, R.: Universally composable protocols with relaxed set-up assumptions. In: FOCS, pp. 186-195. IEEE Computer Society, Los Alamitos (2004)
-
(2004)
IEEE Computer Society
, pp. 186-195
-
-
Barak, B.1
Canetti, R.2
Nielsen, J.B.3
Pass, R.4
-
4
-
-
84874324906
-
Identity-based encryption from the weil pairing
-
Kilian, J, ed, CRYPTO 2001, Springer, Heidelberg
-
Boneh, D., Franklin, M.K.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213-229. Springer, Heidelberg (2001)
-
(2001)
LNCS
, vol.2139
, pp. 213-229
-
-
Boneh, D.1
Franklin, M.K.2
-
5
-
-
0035163054
-
Universally composable security: A new paradigm for cryptographic protocols
-
Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS, pp. 136-145 (2001)
-
(2001)
FOCS
, pp. 136-145
-
-
Canetti, R.1
-
6
-
-
84880897758
-
Universally composable commitments
-
Kilian, J, ed, CRYPTO 2001, Springer, Heidelberg
-
Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 19-40. Springer, Heidelberg (2001)
-
(2001)
LNCS
, vol.2139
, pp. 19-40
-
-
Canetti, R.1
Fischlin, M.2
-
7
-
-
84947232363
-
Universally composable notions of key exchange and secure channels
-
Knudsen, L.R, ed, EUROCRYPT 2002, Springer, Heidelberg
-
Canetti, R., Krawczyk, H.: Universally composable notions of key exchange and secure channels. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 337-351. Springer, Heidelberg (2002)
-
(2002)
LNCS
, vol.2332
, pp. 337-351
-
-
Canetti, R.1
Krawczyk, H.2
-
8
-
-
67049107398
-
-
Naor [Nao07, pp
-
Camenisch, J., Neven, G., Shelat, A.: Simulatable adaptive oblivious transfer. In: Naor [Nao07], pp. 573-590
-
Simulatable adaptive oblivious transfer
, pp. 573-590
-
-
Camenisch, J.1
Neven, G.2
Shelat, A.3
-
9
-
-
84937437506
-
Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor
-
Yung, M, ed, CRYPTO 2002, Springer, Heidelberg
-
DamgAard, I., Nielsen, J.B.: Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 581-596. Springer, Heidelberg (2002)
-
(2002)
LNCS
, vol.2442
, pp. 581-596
-
-
DamgAard, I.1
Nielsen, J.B.2
-
10
-
-
44449160378
-
Isolated proofs of knowledge and isolated zero knowledge
-
Smart, N.P, ed, EUROCRYPT 2008, Springer, Heidelberg
-
DamgAard, I., Nielsen, J.B., Wichs, D.: Isolated proofs of knowledge and isolated zero knowledge. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 509-526. Springer, Heidelberg (2008)
-
(2008)
LNCS
, vol.4965
, pp. 509-526
-
-
DamgAard, I.1
Nielsen, J.B.2
Wichs, D.3
-
11
-
-
33745660116
-
-
Fischlin, M.: Universally composable oblivious transfer in the multi-party setting. In: Pointcheval, D. (ed.) CT-RSA 2006. LNCS, 3860, pp. 332-349. Springer, Heidelberg (2006)
-
Fischlin, M.: Universally composable oblivious transfer in the multi-party setting. In: Pointcheval, D. (ed.) CT-RSA 2006. LNCS, vol. 3860, pp. 332-349. Springer, Heidelberg (2006)
-
-
-
-
12
-
-
35048837620
-
-
Garay, J.A.: Efficient and universally composable committed oblivious transfer and applications. In: Naor, M. (ed.) TCC 2004. LNCS, 2951, pp. 297-316. Springer, Heidelberg (2004)
-
Garay, J.A.: Efficient and universally composable committed oblivious transfer and applications. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 297-316. Springer, Heidelberg (2004)
-
-
-
-
13
-
-
38149091799
-
Blind identity-based encryption and simulat- able oblivious transfer
-
Kurosawa, K, ed, ASIACRYPT 2007, Springer, Heidelberg
-
Green, M., Hohenberger, S.: Blind identity-based encryption and simulat- able oblivious transfer. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 265-282. Springer, Heidelberg (2007)
-
(2007)
LNCS
, vol.4833
, pp. 265-282
-
-
Green, M.1
Hohenberger, S.2
-
14
-
-
58349109585
-
Universally composable adaptive oblivious transfer
-
Pieprzyk, Y, ed, ASIACRYPT 2008, Springer, Heidelberg
-
Green, M., Hohenberger, S.: Universally composable adaptive oblivious transfer. In: Pieprzyk, Y. (ed.) ASIACRYPT 2008. LNCS vol. 5350, pp. 179-197. Springer, Heidelberg (2008)
-
(2008)
LNCS
, vol.5350
, pp. 179-197
-
-
Green, M.1
Hohenberger, S.2
-
15
-
-
0023545076
-
-
Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC, pp. 218-229. ACM, New York (1987)
-
Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC, pp. 218-229. ACM, New York (1987)
-
-
-
-
16
-
-
33746072569
-
Perfect non-interactive zero knowledge for np
-
Vaudenay, S, ed, EUROCRYPT 2006, Springer, Heidelberg
-
Groth, J., Ostrovsky, R., Sahai, A.: Perfect non-interactive zero knowledge for np. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 339-358. Springer, Heidelberg (2006)
-
(2006)
LNCS
, vol.4004
, pp. 339-358
-
-
Groth, J.1
Ostrovsky, R.2
Sahai, A.3
-
17
-
-
44449140946
-
Efficient non-interactive proof systems for bilinear groups
-
Smart, N.P, ed, EUROCRYPT 2008, Springer, Heidelberg
-
Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 415-432. Springer, Heidelberg (2008), http://eprint.iacr.org/2007/155
-
(2008)
LNCS
, vol.4965
, pp. 415-432
-
-
Groth, J.1
Sahai, A.2
-
18
-
-
84946844750
-
-
Joux, A.: A one round protocol for tripartite diffie-hellman. In: Bosma, W. (ed.) ANTS 2000. LNCS, 1838, pp. 385-394. Springer, Heidelberg (2000)
-
Joux, A.: A one round protocol for tripartite diffie-hellman. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 385-394. Springer, Heidelberg (2000)
-
-
-
-
20
-
-
24944473997
-
Smooth projective hashing and two-message oblivious transfer
-
Cramer, R, ed, EUROCRYPT 2005, Springer, Heidelberg
-
Kalai, Y.T.: Smooth projective hashing and two-message oblivious transfer. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 78-95. Springer, Heidelberg (2005)
-
(2005)
LNCS
, vol.3494
, pp. 78-95
-
-
Kalai, Y.T.1
-
21
-
-
43149086402
-
-
Lindell, A.Y.: Efficient fully-simulatable oblivious transfer. In: Malkin, T.G. (ed.) CT-RSA 2008. LNCS, 4964, pp. 52-70. Springer, Heidelberg (2008), http://eprint.iacr.org/2008/035
-
Lindell, A.Y.: Efficient fully-simulatable oblivious transfer. In: Malkin, T.G. (ed.) CT-RSA 2008. LNCS, vol. 4964, pp. 52-70. Springer, Heidelberg (2008), http://eprint.iacr.org/2008/035
-
-
-
-
22
-
-
0027662341
-
Reducing elliptic curve logarithms to logarithms in a finite field
-
Menezes, A., Okamoto, T., Vanstone, S.A.: Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Transactions on Information Theory 39(5), 1639-1646 (1993)
-
(1993)
IEEE Transactions on Information Theory
, vol.39
, Issue.5
, pp. 1639-1646
-
-
Menezes, A.1
Okamoto, T.2
Vanstone, S.A.3
-
23
-
-
67049122484
-
EUROCRYPT 2007
-
Naor, M, ed, Springer, Heidelberg
-
Naor, M. (ed.): EUROCRYPT 2007. LNCS, vol. 4515. Springer, Heidelberg (2007)
-
(2007)
LNCS
, vol.4515
-
-
-
25
-
-
22044454088
-
Computationally secure oblivious transfer
-
Naor, M., Pinkas, B.: Computationally secure oblivious transfer. J. Cryp- tology 18(1), 1-35 (2005)
-
(2005)
J. Cryp- tology
, vol.18
, Issue.1
, pp. 1-35
-
-
Naor, M.1
Pinkas, B.2
-
26
-
-
44649191238
-
A framework for efficient and composable oblivious transfer. Cryptology ePrint Archive
-
Report 2007/348
-
Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. Cryptology ePrint Archive, Report 2007/348 (2007), http://eprint.iacr.org/
-
(2007)
-
-
Peikert, C.1
Vaikuntanathan, V.2
Waters, B.3
-
27
-
-
0003462641
-
How to exchange secrets by oblivious transfer
-
Technical Report TR-81, Harvard Aiken Computation Laboratory
-
Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard Aiken Computation Laboratory (1981)
-
(1981)
-
-
Rabin, M.O.1
-
28
-
-
0001998264
-
Conjugate coding
-
Wiesner, S.: Conjugate coding. SIGACT News 15(1), 78-88 (1983)
-
(1983)
SIGACT News
, vol.15
, Issue.1
, pp. 78-88
-
-
Wiesner, S.1
-
29
-
-
0022882770
-
-
Yao, A.C.-C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162-167. IEEE, Los Alamitos (1986)
-
Yao, A.C.-C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162-167. IEEE, Los Alamitos (1986)
-
-
-
|