{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:28:49Z","timestamp":1742988529315,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642243158"},{"type":"electronic","value":"9783642243165"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24316-5_16","type":"book-chapter","created":{"date-parts":[[2011,9,10]],"date-time":"2011-09-10T02:35:22Z","timestamp":1315622122000},"page":"222-239","source":"Crossref","is-referenced-by-count":5,"title":["Universally Composable Private Proximity Testing"],"prefix":"10.1007","author":[{"given":"Rafael","family":"Tonicelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernardo Machado","family":"David","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vin\u00edcius","family":"de Morais Alves","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-30144-8_6","volume-title":"Information Security","author":"M. Backes","year":"2004","unstructured":"Backes, M., Hofheinz, D.: How to Break and Repair a Universally Composable Signature Functionality. In: Zhang, K., Zheng, Y. (eds.) ISC 2004. LNCS, vol.\u00a03225, pp. 61\u201372. Springer, Heidelberg (2004)"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Beaver, D.: Commodity-Based Cryptography (Extended Abstract). In: STOC 1997, pp. 446\u2013455 (1997)","DOI":"10.1145\/258533.258637"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Beaver, D.: Server-Assisted Cryptography. In: New Security Paradigms Workshop 1998, pp. 92\u2013106 (1998)","DOI":"10.1145\/310889.310923"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"M. Bellare","year":"1996","unstructured":"Bellare, M., Canetti, R., Krawczyk, H.: Keying Hash Functions for Message Authentication. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 1\u201315. Springer, Heidelberg (1996)"},{"issue":"1-3","key":"16_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1023\/A:1016501125022","volume":"26","author":"C. Blundo","year":"2002","unstructured":"Blundo, C., Masucci, B., Stinson, D.R., Wei, R.: Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes. Designs, Codes, and Cryptography\u00a026(1-3), 97\u2013110 (2002)","journal-title":"Designs, Codes, and Cryptography"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0166-218X(00)00342-5","volume":"111","author":"F. Boudot","year":"2001","unstructured":"Boudot, F., Schoenmakers, B., Traore, J.: A fair and efficient solution to the socialist millionaires problem. Discrete Applied Mathematics\u00a0111, 23\u201336 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/229459.229469","volume":"39","author":"R. Fagin","year":"1996","unstructured":"Fagin, R., Naor, M., Winkler, P.: Comparing information without leaking it. Communications of the ACM\u00a039, 77\u201385 (1996)","journal-title":"Communications of the ACM"},{"key":"16_CR8","unstructured":"Brakerski, Z., Kalai, Y.T.: A Framework for Efficient Signatures, Ring signatures and Identity based Encryption in the Standard Model. Cryptology ePrint Archive, Report 2010\/086 (2010), http:\/\/eprint.iacr.org\/2010\/086.pdf"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-44987-6_28","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Krawczyk, H.: Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 453\u2013474. Springer, Heidelberg (2001)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols. In: 42nd Symposium on Foundations of Computer Science (FOCS) (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-44647-8_2","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Fischlin, M.: Universally Composable Commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 19\u201340. Springer, Heidelberg (2001)"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/3-540-46035-7_22","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"R. Canetti","year":"2002","unstructured":"Canetti, R., Krawczyk, H.: Universally Composable Notions of Key Exchange and Secure Channels. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 337\u2013351. Springer, Heidelberg (2002)"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally Composable Two-Party and Multi-party Secure Computation. In: 34th STOC, pp. 494\u2013503 (2002)","DOI":"10.1145\/509907.509980"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-540-78967-3_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"N. Chandran","year":"2008","unstructured":"Chandran, N., Goyal, V., Sahai, A.: New Constructions for UC Secure Computation Using Tamper-Proof Hardware. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 289\u2013306. Springer, Heidelberg (2008)"},{"issue":"2","key":"16_CR15","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1587\/transfun.E94.A.725","volume":"94","author":"R. Dowsley","year":"2011","unstructured":"Dowsley, R., Nascimento, A.C.A., M\u00fcller-Quade, J., Otsuka, A., Hanaoka, G., Imai, H.: Universally Composable and Statistically Secure Verifiable Secret Sharing Scheme Based on Pre-Distributed Data. IEICE Transactions\u00a094(2), 725\u2013734 (2011)","journal-title":"IEICE Transactions"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-11799-2_8","volume-title":"Theory of Cryptography","author":"I. Damg\u00e5rd","year":"2010","unstructured":"Damg\u00e5rd, I., Nielsen, J.B., Orlandi, C.: On the Necessary and Sufficient Assumptions for UC Computation. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 109\u2013127. Springer, Heidelberg (2010)"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-540-88733-1_22","volume-title":"Provable Security","author":"S. Gajek","year":"2008","unstructured":"Gajek, S., Manulis, M., Pereira, O., Sadeghi, A.-R., Schwenk, J.: Universally Composable Security Analysis of TLS. In: Baek, J., Bao, F., Chen, K., Lai, X. (eds.) ProvSec 2008. LNCS, vol.\u00a05324, pp. 313\u2013327. Springer, Heidelberg (2008)"},{"key":"16_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography, Basic Applications","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography, Basic Applications, vol.\u00a0II. Cambridge University Press, Cambridge (2004)"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/3-540-44448-3_11","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"G. Hanaoka","year":"2000","unstructured":"Hanaoka, G., Shikata, J., Zheng, Y., Imai, H.: Unconditionally Secure Digital Signature Schemes Admitting Transferability. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 130\u2013142. Springer, Heidelberg (2000)"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-40061-5_27","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"H. Lipmaa","year":"2003","unstructured":"Lipmaa, H.: Verifiable homomorphic oblivious transfer and private equality test. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 416\u2013433. Springer, Heidelberg (2003)"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/3-540-48184-2_14","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"T. Matsumoto","year":"1988","unstructured":"Matsumoto, T., Imai, H.: On the Key Predistribution System: A Practical Solution to the Key Distribution Problem. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 185\u2013193. Springer, Heidelberg (1988)"},{"key":"16_CR22","unstructured":"Narayanan, A., Thiagarajan, N., Lakhani, M., Hamburg, M., Boneh, D.: Location Privacy via Private Proximity Testing. In: NDSS (2011)"},{"key":"16_CR23","unstructured":"Orlandi, C.: Oblivious Transfer in the Universally Composable Security Model. MSc Thesis in Computer Engineering, Universita degli Studi di Firenze (2007)"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Pass, R.: Bounded-Concurrent Secure Multi-Party Computation with a Dishonest Majority. In: 36th STOC, pp. 232\u2013241 (2004)","DOI":"10.1145\/1007352.1007393"},{"key":"16_CR25","unstructured":"Rivest, R.: Unconditionally Secure Commitment and Oblivious Transfer Schemes Using Concealing Channels and a Trusted Initializer (1999) (preprint), http:\/\/people.csail.mit.edu\/rivest\/Rivest-commitment.pdf"},{"key":"16_CR26","unstructured":"Tonicelli, R., Nascimento, A.C.A., Dowsley, R., M\u00fcller-Quade, J., Imai, H., Hanaoka, G., Otsuka, A.: Information-Theoretically Secure Oblivious Polynomial Evaluation in the Commodity-Based Model.Cryptology ePrint Archive, Report 2009\/270 (2009), http:\/\/eprint.iacr.org\/2009\/270"},{"key":"16_CR27","unstructured":"Qiu, D., Boneh, D., Lo, S., Enge, P.: Robust location tag generation from Noisy Location Data for Security Applications. The Institute of Navigation International Technical Meeting (2009)"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for Secure Computations. In: FOCS 1982, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Provable Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24316-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T03:49:09Z","timestamp":1560570549000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24316-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642243158","9783642243165"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24316-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}