[1] |
RABIN M O . How to Exchange Secretes by Oblivious Transfer[R]. Tech Rep TR-81,Aiken Computation Laboratory,Harvard University, 1981.
|
[2] |
EVEN S , GOLDREICH O , LEMPEL A . A randomized protocol for signing contracts[J]. Communications of the ACM, 1985,28(6): 637-647.
|
[3] |
NAOR M , PINKAS B . Efficient oblivious transfer protocols[A]. Proceedings of SODA 2001,SIAM Symposium on Discrete Algorithms[C]. 2001. 448-457.
|
[4] |
KALAI Y T . Smooth projective hashing and two-message oblivious transfer[A]. Advances in Cryptology-Eurocrypt 2005,LNCS 3494[C]. Springer-Verlag, 2005. 78-95.
|
[5] |
DOLEV D , YAO A . On the security of public key protocols[J]. IEEE Transactions on Information Theory, 1983,29(2): 198-208.
|
[6] |
FISCHLIN M . Universally composable oblivious transfer in the multi-party setting[EB/OL]. , 2006.
|
[7] |
CANETTI R . Universally Composable Security:a New Paradigm for Cryptographic Protocols[M]. New York: IEEE Computer Society PressPress, 2001.
|
[8] |
CANETTI R , LINDELL Y , OSTROVSKY R ,et al. Universally composable two-party and multi-party secure computation[A]. Proceedings of the 34th Annual ACM Symposium on Theory of Computing[C]. Montréal,Québec,Canada, 2002. 494-503.
|
[9] |
GOLDREICH O , MICALI S , WIGDERSON A . How to play any mental game – a completeness theorem for protocols with honest majority[A]. Proceedings of the 19th Annual ACM Symposium on Theory of Computing[C]. 1987. 218-229.
|
[10] |
DAMGARD I , NIELSEN J B . Improved non-committing encryption schemes based on a general complexity assumption[A]. Crypto 2000,LNCS 1880[C]. Springer-Verlag, 2000. 432-450.
|
[11] |
CRAMER R , SHOUP V . Universal hash proofs and a paradigm for adaptive chosen cipher text secure public-key encryption[A]. Advances in Cryptology-Eurocrypt 2002,LNCS 2332[C]. Springer-Verlag, 2002. 45-64.
|
[12] |
CANETTI R , HALEVI S , KATZ J . Adaptively-secure,non-interactive public-key encryption[A]. the 2nd Theory of Cryptography Conference (TCC)[C]. 2005.
|
[13] |
PAILLIER P . Public-key cryptosystems based on composite-degree residuosity classes[A]. Advances in Cryptology-Eurocrypt 1999,LNCS 1592[C]. Springer-Verlag, 1999. 223-238.
|