{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T22:23:19Z","timestamp":1693693399484},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,10,26]],"date-time":"2012-10-26T00:00:00Z","timestamp":1351209600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Period Math Hung"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s10998-012-6512-6","type":"journal-article","created":{"date-parts":[[2012,10,25]],"date-time":"2012-10-25T01:47:55Z","timestamp":1351129675000},"page":"167-176","source":"Crossref","is-referenced-by-count":2,"title":["Anonymous sealed bid auction protocol based on a variant of the dining cryptographers\u2019 protocol"],"prefix":"10.1007","volume":"65","author":[{"given":"Mih\u00e1ly","family":"B\u00e1r\u00e1sz","sequence":"first","affiliation":[]},{"given":"P\u00e9ter","family":"Ligeti","sequence":"additional","affiliation":[]},{"given":"L\u00e1szl\u00f3","family":"M\u00e9rai","sequence":"additional","affiliation":[]},{"given":"D\u00e1niel A.","family":"Nagy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,10,26]]},"reference":[{"key":"6512_CR1","doi-asserted-by":"crossref","unstructured":"M. Abe and K. Suzuki, Receipt-free sealed-bid auction, ISC\u2019 02, 2002, 191\u2013199.","DOI":"10.1007\/3-540-45811-5_14"},{"key":"6512_CR2","doi-asserted-by":"crossref","unstructured":"L. Von Ahn, A. Bortz and J. Hopper N., k-anonymous message transmission, CCS\u2019 03 (Proceedings of the 10th ACM conference on Computer and communications security), 2003, 122\u2013130.","DOI":"10.1145\/948125.948128"},{"key":"6512_CR3","unstructured":"M. B\u00e1r\u00e1sz, P. Ligeti, L. M\u00e9rai and D. A. Nagy, Another twist in the dining cryptographers\u2019 protocol, Journal of Cryptology, submitted."},{"key":"6512_CR4","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway, Random oracles are practical: a paradigm for designing efficient protocols, ACM CCS\u2019 93, ACM Press, 1993, 62\u201373.","DOI":"10.1145\/168588.168596"},{"key":"6512_CR5","unstructured":"F. Brandt, Secure and private auctions without auctioneers, Technical Report FKI-245-02, 2002."},{"key":"6512_CR6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s10207-006-0001-y","volume":"5","author":"F. Brandt","year":"2006","unstructured":"F. Brandt, How to obtain full privacy in auctions, International Journal of Information Security, 5 (2006), 201\u2013216.","journal-title":"International Journal of Information Security"},{"key":"6512_CR7","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D. Chaum","year":"1988","unstructured":"D. Chaum, The dining cryptographers problem: unconditional sender and recipient untraceability, Journal of Cryptology, 1 (1988), 65\u201375.","journal-title":"Journal of Cryptology"},{"key":"6512_CR8","doi-asserted-by":"crossref","unstructured":"K. Chida, K. Kobayashi and H. Morita, Efficient sealed-bid auctions for massive numbers of bidders with lump comparison, ISC\u2019 01, 2001, 408\u2013419.","DOI":"10.1007\/3-540-45439-X_28"},{"key":"6512_CR9","first-page":"111","volume":"8","author":"R. Cramer","year":"1995","unstructured":"R. Cramer, I. Damg\u00e5rd and B. Schoenmakers, Proofs of partial knowledge and simplified design of witness hiding protocols, CWI Quarterly, 8 (1995), 111\u2013127.","journal-title":"CWI Quarterly"},{"key":"6512_CR10","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1109\/32.502223","volume":"22","author":"M. K. Franklin","year":"1996","unstructured":"M. K. Franklin and M. K. Reiter, The design and implementation of a secure auction service, IEEE Transactions on Software Engineering, 22 (1996), 302\u2013312.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"6512_CR11","doi-asserted-by":"crossref","unstructured":"P. Golle and A. Juels, Dining cryptographers revisited, Eurocrypt 2004, Lecture Notes in Computer Science, 3027, 2004, 456\u2013473.","DOI":"10.1007\/978-3-540-24676-3_27"},{"key":"6512_CR12","first-page":"2161","volume":"41","author":"T. Nakanishi","year":"2000","unstructured":"T. Nakanishi, T. Fujiwara and H. Watanabe, An anonymous bidding protocol without any reliable center, Trans. IPS. Japan, 41 (2000), 2161\u20132169.","journal-title":"Trans. IPS. Japan"},{"key":"6512_CR13","doi-asserted-by":"crossref","unstructured":"T. Nakanishi, D. Yamamoto and Y. Sugiyama, Sealed-bid auctions with efficient bids, ICISC 2003, Lecture Notes in Computer Science, 2971, 2004, 230\u2013244.","DOI":"10.1007\/978-3-540-24691-6_18"},{"key":"6512_CR14","doi-asserted-by":"crossref","unstructured":"C. A. Neff, A verifiable secret shuffle and its application to e-voting, ACM CCS, 2001, 116\u2013125.","DOI":"10.1145\/501983.502000"},{"key":"6512_CR15","unstructured":"C. A. Neff, Verifiable mixing (shuffling) of ElGamal pairs, VoteHere document, 2004, http:\/\/votehere.net\/vhti\/documentation\/egshuf-2.0.3638.pdf ."},{"key":"6512_CR16","doi-asserted-by":"crossref","unstructured":"M. Nojoumian and D. R. Stinson, Unconditionally secure first-price auction protocols Using a multicomponent commitment scheme, ICICS\u20192010, 2010, 266\u2013280.","DOI":"10.1007\/978-3-642-17650-0_19"},{"key":"6512_CR17","doi-asserted-by":"crossref","unstructured":"K. Peng, C. Boyd, E. Dawson, Optimization of electronic first-bid sealed-bid auction based on homomorphic secret sharing, Progress in Cryptology \u2014 Mycrypt 2005, Lecture Notes in Computer Science, 3715, 2005, 84\u201398.","DOI":"10.1007\/11554868_7"},{"key":"6512_CR18","doi-asserted-by":"crossref","unstructured":"F. Stajano and R. J. Anderson, The cocaine auction protocol: on the power of anonymous broadcast, IH\u2019 99, Lecture Notes in Computer Science, 1768, 1999, 434\u2013447.","DOI":"10.1007\/10719724_30"},{"key":"6512_CR19","doi-asserted-by":"crossref","unstructured":"K. Suzuki, K. Kobayashi and H. Morita, Efficient sealed-bid auction using hash chain, ICISC\u2019 00, 2001, 183\u2013191.","DOI":"10.1007\/3-540-45247-8_15"},{"key":"6512_CR20","doi-asserted-by":"crossref","unstructured":"M. Waidner and B. Pfitzmann, The dining cryptographers in the disco \u2014 under-conditional sender and recipient untraceability with computationally secure serviceability (abstract), Eurocrypt 1989, Lecture Notes in Computer Science, 434, 1989, 690.","DOI":"10.1007\/3-540-46885-4_69"}],"container-title":["Periodica Mathematica Hungarica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10998-012-6512-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10998-012-6512-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10998-012-6512-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T20:02:59Z","timestamp":1562270579000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10998-012-6512-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,26]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["6512"],"URL":"https:\/\/doi.org\/10.1007\/s10998-012-6512-6","relation":{},"ISSN":["0031-5303","1588-2829"],"issn-type":[{"value":"0031-5303","type":"print"},{"value":"1588-2829","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,26]]}}}