{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T04:13:53Z","timestamp":1745468033434,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642351297"},{"type":"electronic","value":"9783642351303"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35130-3_17","type":"book-chapter","created":{"date-parts":[[2012,12,10]],"date-time":"2012-12-10T07:09:45Z","timestamp":1355123385000},"page":"238-248","source":"Crossref","is-referenced-by-count":2,"title":["Coercion Resistant MIX for Electronic Auction"],"prefix":"10.1007","author":[{"given":"Jaydeep","family":"Howlader","sequence":"first","affiliation":[]},{"given":"Jayanta","family":"Kar","sequence":"additional","affiliation":[]},{"given":"Ashis Kumar","family":"Mal","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/978-3-642-22792-9_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"A. O\u2019Neill","year":"2011","unstructured":"O\u2019Neill, A., Peikert, C., Waters, B.: Bi-Deniable Public-Key Encryption. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 525\u2013542. Springer, Heidelberg (2011)"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44702-4_1","volume-title":"Designing Privacy Enhancing Technologies","author":"A. Pfitzmann","year":"2001","unstructured":"Pfitzmann, A., K\u00f6hntopp, M.: Anonymity, Unobservability, and Pseudonymity - A Proposal for Terminology. In: Federrath, H. (ed.) Anonymity 2000. LNCS, vol.\u00a02009, pp. 1\u20139. Springer, Heidelberg (2001)"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/BFb0053448","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"B. Pfitzmann","year":"1995","unstructured":"Pfitzmann, B.: Breaking an Efficient Anonymous Channel. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 332\u2013340. Springer, Heidelberg (1995)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/3-540-46885-4_37","volume-title":"Advances in Cryptology - EUROCRYPT \u201989","author":"B. Pfitzmann","year":"1990","unstructured":"Pfitzmann, B., Pfitzmann, A.: How to Break the Direct RSA-Implementation of MIXes. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol.\u00a0434, pp. 373\u2013381. Springer, Heidelberg (1990)"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Benaloh, J.C., Tuinstra, D.: Receipt-free secret-ballot elections (extended abstract). In: STOC, pp. 544\u2013553 (1994)","DOI":"10.1145\/195058.195407"},{"key":"17_CR6","series-title":"LNEE","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-642-21747-0_7","volume-title":"Electrical Power Systems and Computers","author":"C. Gao","year":"2011","unstructured":"Gao, C., Yao, Z., Xie, D., Wei, B.: Electronic Sealed-Bid Auctions with Incoercibility. In: Wan, X. (ed.) Electrical Power Systems and Computers. LNEE, vol.\u00a099, pp. 47\u201354. Springer, Heidelberg (2011)"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/3-540-48285-7_21","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"C. Park","year":"1994","unstructured":"Park, C., Itoh, K., Kurosawa, K.: Efficient Anonymous Channel and All\/Nothing Election Scheme. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 248\u2013259. Springer, Heidelberg (1994)"},{"key":"17_CR8","first-page":"159","volume":"8","author":"M.H. Ibrahim","year":"2009","unstructured":"Ibrahim, M.H.: A method for obtaining deniable public-key encryption. IJNS\u00a08, 159\u2013165 (2009)","journal-title":"IJNS"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Zheng, H., Weidong, Q., Kefei, G.C.: Efficient receipt-free electronic auction protocol. In: SITIS, pp. 1023\u20131028 (2007)","DOI":"10.1109\/SITIS.2007.47"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/3-540-44598-6_27","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"I. Damg\u00e5rd","year":"2000","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Improved Non-committing Encryption Schemes Based on a General Complexity Assumption. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 432\u2013450. Springer, Heidelberg (2000)"},{"key":"17_CR11","series-title":"CCIS","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-03547-0_22","volume-title":"Contemporary Computing","author":"J. Howlader","year":"2009","unstructured":"Howlader, J., Ghosh, A., Pal, T.D.: Secure Receipt-Free Sealed-Bid Electronic Auction. In: Ranka, S., Aluru, S., Buyya, R., Chung, Y.-C., Dua, S., Grama, A., Gupta, S.K.S., Kumar, R., Phoha, V.V. (eds.) IC3 2009. CCIS, vol.\u00a040, pp. 228\u2013239. Springer, Heidelberg (2009)"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Howlader, J., Basu, S.: Sender-side public key deniable encryption scheme. In: ARTCom, pp. 9\u201313 (2009)","DOI":"10.1109\/ARTCom.2009.107"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/3-540-49264-X_32","volume-title":"Advances in Cryptology - EUROCRYPT \u201995","author":"K. Sako","year":"1995","unstructured":"Sako, K., Kilian, J.: Receipt-Free Mix-Type Voting Scheme: A Practical Solution to the Implementation of a Voting Booth. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 393\u2013403. Springer, Heidelberg (1995)"},{"issue":"2","key":"17_CR14","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D.L. Chaum","year":"1981","unstructured":"Chaum, D.L.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM\u00a024(2), 84\u201390 (1981)","journal-title":"Commun. ACM"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BFb0054144","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"M. Abe","year":"1998","unstructured":"Abe, M.: Universally Verifiable Mix-Net with Verification Work Independent of the Number of Mix-Servers. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 437\u2013447. Springer, Heidelberg (1998)"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/3-540-45811-5_14","volume-title":"Information Security","author":"M. Abe","year":"2002","unstructured":"Abe, M., Suzuki, K.: Receipt-Free Sealed-Bid Auction. In: Chan, A.H., Gligor, V.D. (eds.) ISC 2002. LNCS, vol.\u00a02433, pp. 191\u2013199. Springer, Heidelberg (2002)"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/978-3-642-20465-4_33","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"M. D\u00fcrmuth","year":"2011","unstructured":"D\u00fcrmuth, M., Freeman, D.M.: Deniable Encryption with Negligible Detection Probability: An Interactive Construction. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 610\u2013626. Springer, Heidelberg (2011)"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/BFb0054145","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"M. Jakobsson","year":"1998","unstructured":"Jakobsson, M.: A Practical Mix. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 448\u2013461. Springer, Heidelberg (1998)"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Jakobsson, M.: Flash mixing. In: PODC, pp. 83\u201389 (1999)","DOI":"10.1145\/301308.301333"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Jakobsson, M., Juels, A.: An optimally robust hybrid mix network. In: PODC, pp. 284\u2013292 (2001)","DOI":"10.1145\/383962.384046"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/978-3-540-77566-9_52","volume-title":"SOFSEM 2008: Theory and Practice of Computer Science","author":"M. Klonowski","year":"2008","unstructured":"Klonowski, M., Kubiak, P., Kuty\u0142owski, M.: Practical Deniable Encryption. In: Geffert, V., Karhum\u00e4ki, J., Bertoni, A., Preneel, B., N\u00e1vrat, P., Bielikov\u00e1, M. (eds.) SOFSEM 2008. LNCS, vol.\u00a04910, pp. 599\u2013609. Springer, Heidelberg (2008)"},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/3-540-44702-4_3","volume-title":"Designing Privacy Enhancing Technologies","author":"O. Berthold","year":"2001","unstructured":"Berthold, O., Pfitzmann, A., Standtke, R.: The Disadvantages of Free MIX Routes and How to Overcome Them. In: Federrath, H. (ed.) Anonymity 2000. LNCS, vol.\u00a02009, pp. 30\u201345. Springer, Heidelberg (2001)"},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-540-24660-2_14","volume-title":"Topics in Cryptology \u2013 CT-RSA 2004","author":"P. Golle","year":"2004","unstructured":"Golle, P., Jakobsson, M., Juels, A., Syverson, P.: Universal Re-encryption for Mixnets. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol.\u00a02964, pp. 163\u2013178. Springer, Heidelberg (2004)"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/BFb0052229","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"R. Canetti","year":"1997","unstructured":"Canetti, R., Dwork, C., Naor, M., Ostrovsky, R.: Deniable Encryption. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 90\u2013104. Springer, Heidelberg (1997)"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively secure multi-party computation. In: STOC, pp. 639\u2013648 (1996)","DOI":"10.1145\/237814.238015"},{"key":"17_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-540-24691-6_20","volume-title":"Information Security and Cryptology - ICISC 2003","author":"X. Chen","year":"2004","unstructured":"Chen, X., Lee, B., Kim, K.: Receipt-Free Electronic Auction Schemes Using Homomorphic Encryption. In: Lim, J.-I., Lee, D.-H. (eds.) ICISC 2003. LNCS, vol.\u00a02971, pp. 259\u2013273. Springer, Heidelberg (2004)"},{"key":"17_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/3-540-45539-6_39","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"Y. Desmedt","year":"2000","unstructured":"Desmedt, Y., Kurosawa, K.: How to Break a Practical MIX and Design a New One. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 557\u2013572. Springer, Heidelberg (2000)"},{"key":"17_CR28","unstructured":"Her, Y.-S., Imamoto, K., Sakurai, K.: Receipt-free sealed-bid auction based on mix-net and pseudo id. In: Computer Security Symposium, pp. 2004\u20132010 (2004)"}],"container-title":["Lecture Notes in Computer Science","Information Systems Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35130-3_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T12:56:25Z","timestamp":1745412985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35130-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642351297","9783642351303"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35130-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}