{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:25:04Z","timestamp":1742937904949,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":45,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642215537"},{"type":"electronic","value":"9783642215544"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","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-21554-4_30","type":"book-chapter","created":{"date-parts":[[2011,6,13]],"date-time":"2011-06-13T07:29:53Z","timestamp":1307950193000},"page":"514-531","source":"Crossref","is-referenced-by-count":0,"title":["Secure Authenticated Comparisons"],"prefix":"10.1007","author":[{"given":"Keith B.","family":"Frikken","sequence":"first","affiliation":[]},{"given":"Hao","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Mikhail J.","family":"Atallah","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","first-page":"62","volume-title":"CCS 1993: Proceedings of the 1st ACM Conference on Computer and Communications Security","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: CCS 1993: Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 62\u201373. ACM, New York (1993)"},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-24676-3_4","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 56\u201373. Springer, Heidelberg (2004)"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-39200-9_26","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 416\u2013432. Springer, Heidelberg (2003)"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-45539-6_31","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"F. Boudot","year":"2000","unstructured":"Boudot, F.: Efficient proofs that a committed number lies in an interval. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 431\u2013444. Springer, Heidelberg (2000)"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-540-89255-7_15","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"J.L. Camenisch","year":"2008","unstructured":"Camenisch, J.L., Chaabouni, R., Shelat, A.: Efficient protocols for set membership and range proofs. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol.\u00a05350, pp. 234\u2013252. Springer, Heidelberg (2008)"},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/3-540-36413-7_20","volume-title":"Security in Communication Networks","author":"J. Camenisch","year":"2003","unstructured":"Camenisch, J., Lysyanskaya, A.: A signature scheme with efficient protocols. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol.\u00a02576, pp. 268\u2013289. Springer, Heidelberg (2003)"},{"issue":"4","key":"30_CR7","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/1008731.1008734","volume":"51","author":"R. Canetti","year":"2004","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology. J. ACM\u00a051(4), 557\u2013594 (2004) (revisited)","journal-title":"J. ACM"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-642-14081-5_21","volume-title":"Information Security and Privacy","author":"R. Chaabouni","year":"2010","unstructured":"Chaabouni, R., Lipmaa, H., Shelat, A.: Additive combinatorics and discrete logarithm based range protocols. In: Steinfeld, R., Hawkes, P. (eds.) ACISP 2010. LNCS, vol.\u00a06168, pp. 336\u2013351. Springer, Heidelberg (2010), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-540-88313-5_12","volume-title":"Computer Security - ESORICS 2008","author":"H. Chen","year":"2008","unstructured":"Chen, H., Ma, X., Hsu, W., Li, N., Wang, Q.: Access control friendly query verification for outsourced data publishing. In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol.\u00a05283, pp. 177\u2013191. Springer, Heidelberg (2008)"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Cheng, W., Pang, H., Tan, K.: Authenticating multi-dimensional query results in data publishing. In: Proceedings of Data and Applications Security XX, 20th Annual IFIP WG 11.3 Working Conference on Data and Applications Security, pp. 60\u201373 (2006)","DOI":"10.1007\/11805588_5"},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-540-75248-6_4","volume-title":"Secure Data Management","author":"W. Cheng","year":"2007","unstructured":"Cheng, W., Tan, K.: Authenticating knn query results in data publishing. In: Jonker, W., Petkovi\u0107, M. (eds.) SDM 2007. LNCS, vol.\u00a04721, pp. 47\u201363. Springer, Heidelberg (2007)"},{"key":"30_CR12","unstructured":"Cramer, R.: Modular design of secure yet practical cryptographic protocols. Ph.D. thesis, CWI and University of Amsterdam (1996)"},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-540-46588-1_24","volume-title":"Public Key Cryptography","author":"R. Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I.B., MacKenzie, P.D.: Efficient zero-knowledge proofs of knowledge without intractability assumptions. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol.\u00a01751, pp. 354\u2013373. Springer, Heidelberg (2000)"},{"key":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-36178-2_8","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"I. Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I., Fujisaki, E.: A statistically-hiding integer commitment scheme based on groups with hidden order. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 125\u2013142. Springer, Heidelberg (2002)"},{"issue":"3","key":"30_CR15","doi-asserted-by":"publisher","first-page":"291","DOI":"10.3233\/JCS-2003-11302","volume":"11","author":"P. Devanbu","year":"2003","unstructured":"Devanbu, P., Gertz, M., Martel, C., Stubblebine, S.G.: Authentic data publication over the Internet. Journal of Computer Security\u00a011(3), 291\u2013314 (2003)","journal-title":"Journal of Computer Security"},{"key":"30_CR16","first-page":"63","volume-title":"CCS 2000: Proceedings of the 7th ACM conference on Computer and Communications Security","author":"G. Durfee","year":"2000","unstructured":"Durfee, G., Franklin, M.: Distribution chain security. In: CCS 2000: Proceedings of the 7th ACM conference on Computer and Communications Security, pp. 63\u201370. ACM, New York (2000)"},{"key":"30_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"E. Fujisaki","year":"1997","unstructured":"Fujisaki, E., Okamoto, T.: Statistical zero knowledge protocols to prove modular polynomial relations. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 16\u201330. Springer, Heidelberg (1997)"},{"key":"30_CR18","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/800057.808675","volume-title":"STOC 1984: Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing","author":"H.N. Gabow","year":"1984","unstructured":"Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: STOC 1984: Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, pp. 135\u2013143. ACM, New York (1984)"},{"key":"30_CR19","unstructured":"Goodrich, M., Tamassia, R.: Efficient authenticated dictionaries with skip lists and commutative hashing. Technical Report, Johns Hopkins Information Security Institute (2000)"},{"key":"30_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-540-79263-5_26","volume-title":"Topics in Cryptology \u2013 CT-RSA 2008","author":"M.T. Goodrich","year":"2008","unstructured":"Goodrich, M.T., Tamassia, R., Triandopoulos, N.: Super-efficient verification of dynamic outsourced databases. In: Malkin, T. (ed.) CT-RSA 2008. LNCS, vol.\u00a04964, pp. 407\u2013424. Springer, Heidelberg (2008)"},{"key":"30_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/3-540-36563-X_20","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"M.T. Goodrich","year":"2003","unstructured":"Goodrich, M.T., Tamassia, R., Triandopoulos, N., Cohen, R.: Authenticated data structures for graph and geometric searching. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 295\u2013313. Springer, Heidelberg (2003)"},{"key":"30_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/11496137_32","volume-title":"Applied Cryptography and Network Security","author":"J. Groth","year":"2005","unstructured":"Groth, J.: Non-interactive zero-knowledge arguments for voting. In: Ioannidis, J., Keromytis, A.D., Yung, M. (eds.) ACNS 2005. LNCS, vol.\u00a03531, pp. 467\u2013482. Springer, Heidelberg (2005)"},{"key":"30_CR23","unstructured":"Haber, S., Horne, W., Sander, T., Yao, D.: Privacy-preserving verification of aggregate queries on outsourced databases. Technical Report of HP Labs, HPL-2006-128 (2006)"},{"key":"30_CR24","unstructured":"Hacig\u00fcm\u00fc\u015f, H., Iyer, B., Mehrotra, S.: Providing database as a service. In: Proceedings of the 18th International Conference on Data Engineering, San Jose, CA, February 26 - March 1 (2002)"},{"issue":"2","key":"30_CR25","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput.\u00a013(2), 338\u2013355 (1984)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"30_CR26","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1137\/0405049","volume":"5","author":"S. Kannan","year":"1992","unstructured":"Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. SIAM J. Discret. Math.\u00a05(4), 596\u2013603 (1992)","journal-title":"SIAM J. Discret. Math."},{"key":"30_CR27","series-title":"fundamental algorithms","volume-title":"The art of computer programming","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The art of computer programming. fundamental algorithms, vol.\u00a0I. Addison-Wesley, Reading (1973)"},{"issue":"3","key":"30_CR28","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1109\/TSMCC.2008.919213","volume":"38","author":"A. Kundu","year":"2008","unstructured":"Kundu, A., Bertino, E.: A new model for secure dissemination of xml content. IEEE Transactions on Systems Man and Cybernetics-Part C-Applications Reviews\u00a038(3), 292\u2013301 (2008)","journal-title":"IEEE Transactions on Systems Man and Cybernetics-Part C-Applications Reviews"},{"issue":"1","key":"30_CR29","doi-asserted-by":"publisher","first-page":"138","DOI":"10.14778\/1453856.1453876","volume":"1","author":"A. Kundu","year":"2008","unstructured":"Kundu, A., Bertino, E.: Structural signatures for tree data structures. Proc. VLDB Endow.\u00a01(1), 138\u2013150 (2008)","journal-title":"Proc. VLDB Endow."},{"key":"30_CR30","doi-asserted-by":"crossref","unstructured":"Li, F.I., Hadjieleftheriou, M., Kollios, G., Reyzin, L.: Dynamic authenticated index structures for outsourced databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Chicago, Illinois, USA, June 27-29, pp. 121\u2013132 (2006)","DOI":"10.1145\/1142473.1142488"},{"key":"30_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-540-40061-5_26","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"H. Lipmaa","year":"2003","unstructured":"Lipmaa, H.: On diophantine complexity and statistical zero-knowledge arguments. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 398\u2013415. Springer, Heidelberg (2003)"},{"key":"30_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/BFb0054015","volume-title":"Public Key Cryptography","author":"W. Mao","year":"1998","unstructured":"Mao, W.: Guaranteed correct sharing of integer factorization with off-line shareholders. In: Imai, H., Zheng, Y. (eds.) PKC 1998. LNCS, vol.\u00a01431, pp. 60\u201371. Springer, Heidelberg (1998)"},{"key":"30_CR33","doi-asserted-by":"crossref","unstructured":"Merkle, R.C.: Protocols for public key cryptosystems. In: IEEE Symposium on Security and Privacy, pp. 122\u2013134 (1980)","DOI":"10.1109\/SP.1980.10006"},{"key":"30_CR34","unstructured":"Mykletun, E., Narasimha, M., Tsudik, G.: Authentication and integrity in outsourced databases. In: Proceedings of ISOC Symposium on Network and Distributed Systems Security, NDSS 2004 (2004)"},{"key":"30_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/11733836_30","volume-title":"Database Systems for Advanced Applications","author":"M. Narasimha","year":"2006","unstructured":"Narasimha, M., Tsudik, G.: Authentication of Outsourced Databases Using Signature Aggregation and Chaining. In: Li Lee, M., Tan, K.-L., Wuwongse, V. (eds.) DASFAA 2006. LNCS, vol.\u00a03882, pp. 420\u2013436. Springer, Heidelberg (2006)"},{"issue":"2","key":"30_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1330332.1330337","volume":"11","author":"H. Pang","year":"2008","unstructured":"Pang, H., Tan, K.: Verifying completeness of relational query answers from online servers. ACM Trans. Inf. Syst. Secur.\u00a011(2), 1\u201350 (2008)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"30_CR37","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1145\/1455770.1455826","volume-title":"CCS 2008: Proceedings of the 15th ACM Conference on Computer and Communications Security","author":"C. Papamanthou","year":"2008","unstructured":"Papamanthou, C., Tamassia, R., Triandopoulos, N.: Authenticated hash tables. In: CCS 2008: Proceedings of the 15th ACM Conference on Computer and Communications Security, pp. 437\u2013448. ACM, New York (2008)"},{"key":"30_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/3-540-46416-6_47","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"T.P. Pedersen","year":"1991","unstructured":"Pedersen, T.P.: A threshold cryptosystem without a trusted party (extended abstract). In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 522\u2013526. Springer, Heidelberg (1991)"},{"issue":"1","key":"30_CR39","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1093\/comjnl\/28.1.5","volume":"28","author":"N. Santoro","year":"1985","unstructured":"Santoro, N., Khatib, R.: Labelling and implicit routing in networks. The Computer Journal\u00a028(1), 5 (1985)","journal-title":"The Computer Journal"},{"key":"30_CR40","doi-asserted-by":"crossref","unstructured":"Schnyder, W.: Planar graphs and poset dimension. Order, 323\u2013343 (1989)","DOI":"10.1007\/BF00353652"},{"key":"30_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"V. Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 256\u2013266. Springer, Heidelberg (1997)"},{"key":"30_CR42","doi-asserted-by":"crossref","unstructured":"Tygar, J.D.: Open problems in electronic commerce. In: Proceedings of 18th ACM PODS (1999)","DOI":"10.1145\/303976.303986"},{"issue":"4","key":"30_CR43","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/358841.358852","volume":"23","author":"J. Vuillemin","year":"1980","unstructured":"Vuillemin, J.: A unifying look at data structures. Commun. ACM\u00a023(4), 229\u2013239 (1980)","journal-title":"Commun. ACM"},{"issue":"3","key":"30_CR44","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1137\/0603036","volume":"3","author":"M. Yannakakis","year":"1982","unstructured":"Yannakakis, M.: The complexity of the partial order dimension problem. SIAM Journal on Algebraic and Discrete Methods\u00a03(3), 351\u2013358 (1982)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"30_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-642-02882-3_15","volume-title":"Computing and Combinatorics","author":"T. Yuen","year":"2009","unstructured":"Yuen, T., Huang, Q., Mu, Y., Susilo, W., Wong, D.S., Yang, G.: Efficient non-interactive range proof. In: Ngo, H.Q. (ed.) COCOON 2009. LNCS, vol.\u00a05609, pp. 138\u2013147. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21554-4_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:08:47Z","timestamp":1558296527000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21554-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215537","9783642215544"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21554-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}