{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T20:02:23Z","timestamp":1761940943432,"version":"build-2065373602"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,3,31]],"date-time":"2006-03-31T00:00:00Z","timestamp":1143763200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mobile Netw Appl"],"published-print":{"date-parts":[[2006,4]]},"DOI":"10.1007\/s11036-005-4472-2","type":"journal-article","created":{"date-parts":[[2006,4,2]],"date-time":"2006-04-02T02:33:02Z","timestamp":1143945182000},"page":"201-210","source":"Crossref","is-referenced-by-count":6,"title":["Verifiable Distributed Oblivious Transfer and Mobile Agent Security"],"prefix":"10.1007","volume":"11","author":[{"given":"Sheng","family":"Zhong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Richard Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,3,31]]},"reference":[{"key":"4472_CR1","doi-asserted-by":"crossref","unstructured":"J. Algesheimer, C. Cachin, J. Camenisch and G. Karjoth, Cryptographic security for mobile code, in: IEEE Symposium on Secutity and Privacy (2001) IEEE pp. 2\u201311.","DOI":"10.1109\/SECPRI.2001.924283"},{"key":"4472_CR2","unstructured":"M. Bellare and S. Micali, Non-interactive oblivious transfer and applications, in: Advances in Cryptology\u2014Proceedings of CRYPTO 89, vol. 435 of Lecture Notes in Computer Science (1990) pp. 547\u2013557."},{"key":"4472_CR3","unstructured":"E.R. Berlekamp, Algebraic Coding Theory (McGraw-Hill, 1968)."},{"key":"4472_CR4","unstructured":"G. Brassard, C. Crepeau and J.-M. Robert All -or- nothing disclosure of secrets, in: Advance in Cryptology \u2013Proceedings of CRYPTO 86, vol. 263 of Lecture Notes in Computer Science (1986) pp. 234\u2013238."},{"key":"4472_CR5","doi-asserted-by":"crossref","unstructured":"C. Cachin, J. Camenisch, J. Killan and J. Muller, One-round secure computation and secure autonomous mobile agents, in: Automata, Languages Programming, 27th International Colloquium, vol. 1853 of Lecture Notes in Computer Notes in Computer Science, (2000) pp. 512\u2013523.","DOI":"10.1007\/3-540-45022-X_43"},{"issue":"6","key":"4472_CR6","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"B. Chor","year":"November 1998","unstructured":"B. Chor, O. Goldreich, E. Kushilevitz and M. Sudan, Private information retrieval, Journal of the ACM 45(6) (1998) 965\u2013982.","journal-title":"Journal of the ACM"},{"key":"4472_CR7","doi-asserted-by":"crossref","unstructured":"R. Cramer, I. Damg\u00e5rd and B. Schoenmakers, Proofs of partial knowledge and simplified design of witness hiding protocols, in: Advances in Cryptology \u2013 Proceeding of CRYPT, vol. 839 of Lecture Notes in Computer Science, Springer, Verlag, (1994) pp. 174\u2013187","DOI":"10.1007\/3-540-48658-5_19"},{"key":"4472_CR8","unstructured":"G. Di Crescenzo, T. Malkin and R. Ostrovsky, Single database private information retrieval implies obivious transfer, in: Advances in Cryptology\u2014Proceedings of EUROCRYPT 2000, vol. 1807 of Lecture Notes in Computer Science (2000) pp. 122\u2013138."},{"key":"4472_CR9","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"S. Even, O. Goldreich and A. Lempel, A randomized protocol for signing contracts, Communications of the ACM 28 (1985) 637\u2013647.","journal-title":"Communications of the ACM"},{"key":"4472_CR10","doi-asserted-by":"crossref","unstructured":"P. Feldman, A practical scheme for non\u2013interactive verifiable secret sharing, in: Proceedings of the 28th IEEE Symposium on Foundations of Computer Science (1987) pp. 427\u2013437.","DOI":"10.1109\/SFCS.1987.4"},{"key":"4472_CR11","doi-asserted-by":"crossref","unstructured":"Y. Gertner, S. Goldwasser, and T. Malkin, A random server model for private information retrieval, in: RANDOM\u201998, vol 1518 of Lecture Notes in Computer Science, (1998) pp. 200\u2013217.","DOI":"10.1007\/3-540-49543-6_17"},{"key":"4472_CR12","doi-asserted-by":"crossref","unstructured":"Y. Gertner, Y. Ishai, E. Kushilevitz and T. Malkin, Protecting data privacy in private information retrieval schemes, in: Proceedings of the 30th Annual ACM Symposium on the Theory of Computing (1998) pp. 151\u2013160.","DOI":"10.1145\/276698.276723"},{"key":"4472_CR13","unstructured":"O. Goldreich, Secure multi-party computation. Working Draft Version 1.1 (1998)."},{"key":"4472_CR14","unstructured":"L. Gong, Java security architecture (JDK1.2) Technical report, Sun Microsystems (1998)."},{"key":"4472_CR15","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz and R. Ostrovsky, Replication is NOT needed: SINGLE database, computationally-private information retrieval, in: Proceedings of the 38th IEEE Symposium on Foundations of Computer Science (1997) pp. 364\u2013373.","DOI":"10.1109\/SFCS.1997.646125"},{"issue":"9","key":"4472_CR16","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"R. J. McEliece","year":"1981","unstructured":"R.J. McEliece and D.V. Sarwate, On sharing secrets and Reed-Solomon codes, Communications of the ACM 24(9) (1981) 583\u2013584.","journal-title":"Communications of the ACM"},{"key":"4472_CR17","doi-asserted-by":"crossref","unstructured":"M. Naor and B. Pinkas, Oblivious transfer and polynomial evaluation. in: Proceedings of the 31st Annual ACM Symposium on the Theory of Computing (1999) pp. 245\u2013254.","DOI":"10.1145\/301250.301312"},{"key":"4472_CR18","doi-asserted-by":"crossref","unstructured":"M. Naor and B. Pinkas, Oblivious transfer with adaptive queries, in: Advances in Cryptology \u2013 Proceeding of CRYPTO 99, vol. 1666 of Lecture Notes in Computer Science (1999) pp. 573\u2013590.","DOI":"10.1007\/3-540-48405-1_36"},{"key":"4472_CR19","unstructured":"M. Naor and B. Pinkas Distributed oblivious transfer. in: Advances in Cryptology ASIACRYPT 2000, vol. 1976 of Lecture Notes in Computer Science, (2000) pp. 205\u2013219."},{"key":"4472_CR20","doi-asserted-by":"crossref","unstructured":"G.C Necula and P. Lee, Safe, untrusted agents using proof-carrying code, in: Mobile Agents and Security, vol. 1419 of Lecture Notes in Computer Science (1998) pp. 61\u201391.","DOI":"10.1007\/3-540-68671-1_5"},{"key":"4472_CR21","unstructured":"T.P. Pedersen, Non-interactive and information-theoretical secure verifiable secret sharing, in: Advances in Cryptology-Proceedings of CRYPTO 91, vol. 576 of Lecture Notes in Computer Science (1992) pp. 129\u2013140."},{"key":"4472_CR22","unstructured":"J. Pieprzyk and X.-M. Zhang, Cheating prevention in secret sharing over GF(pt), in: INDOCRYPT 2001, vol. 2247 of Lecture Notes in Computer Science (2001) pp. 79\u201390."},{"key":"4472_CR23","unstructured":"M. Rabin, How to exchange secrets by oblivious transfer, Tech. memo TR-81, (Aiken Computation Laboratory, Havard Univ., 1981)."},{"key":"4472_CR24","doi-asserted-by":"crossref","unstructured":"T. Rabin and M. Ben-or. Verifiable secret sharing and multiparty protocols with honest majority, in: Proceedings of 21th Annual ACM Symposium on the Theory of Computing (1989) pp. 73\u201385.","DOI":"10.1145\/73007.73014"},{"key":"4472_CR25","doi-asserted-by":"crossref","unstructured":"T. Sander and C. Tschudin, Protecting mobile agents against malicious hosts, in: Mobile Agents and Security, vol. 1419 of Lecture Notes in Computer Science, (1998) pp. 44\u201360.","DOI":"10.1007\/3-540-68671-1_4"},{"key":"4472_CR26","doi-asserted-by":"crossref","unstructured":"Tomas Sander, Adam Young, and Moti Young, Non-interactive cryptocomputing for NC1, in: Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (1998) pp. 554\u2013567. ACM.","DOI":"10.1109\/SFFCS.1999.814630"},{"issue":"11","key":"4472_CR27","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir, How to share a secret, Communications of the ACM 22(11) (1979) 612\u2013613.","journal-title":"Communications of the ACM"},{"key":"4472_CR28","unstructured":"S.R. Tate and K. Xu, Mobile agent security through multi-agent cryptographic protocols, in: Proceedings of the 4th International Conference on Intrnet Computing (IC 2003) (2003) pp. 462\u2013468."},{"key":"4472_CR29","doi-asserted-by":"crossref","unstructured":"A. Yao, How to generate and exchange secrets, in: Proceedings of the 27th IEEE Symposium on Foundations of Computer Science (1986) pp. 162\u2013167.","DOI":"10.1109\/SFCS.1986.25"},{"key":"4472_CR30","unstructured":"X.-M. Zhang and J. Pieprzuk, Cheating immune secret sharing, in: ICICS 2001, vol. 2229 of Lecture Notes In Computer Science, (2001) pp. 144\u2013149."}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-005-4472-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11036-005-4472-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-005-4472-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T06:18:18Z","timestamp":1736317098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11036-005-4472-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3,31]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,4]]}},"alternative-id":["4472"],"URL":"https:\/\/doi.org\/10.1007\/s11036-005-4472-2","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"type":"print","value":"1383-469X"},{"type":"electronic","value":"1572-8153"}],"subject":[],"published":{"date-parts":[[2006,3,31]]}}}