{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:46:19Z","timestamp":1750308379354,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":5,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,7,16]],"date-time":"2012-07-16T00:00:00Z","timestamp":1342396800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,7,16]]},"DOI":"10.1145\/2332432.2332453","type":"proceedings-article","created":{"date-parts":[[2012,7,19]],"date-time":"2012-07-19T14:38:27Z","timestamp":1342708707000},"page":"101-102","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Brief announcement"],"prefix":"10.1145","author":[{"given":"Ashish","family":"Choudhury","sequence":"first","affiliation":[{"name":"University of Bristol, Bristol, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2012,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","volume-title":"EUROCRYPT","author":"Johansson T.","year":"1993"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/646760.705997"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/358746.358762"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2008684.2008707"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"}],"event":{"name":"PODC '12: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","INESC-ID INESC-ID Lisboa"],"location":"Madeira Portugal","acronym":"PODC '12"},"container-title":["Proceedings of the 2012 ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2332432.2332453","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2332432.2332453","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:44:38Z","timestamp":1750268678000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2332432.2332453"}},"subtitle":["optimal amortized secret sharing with cheater identification"],"short-title":[],"issued":{"date-parts":[[2012,7,16]]},"references-count":5,"alternative-id":["10.1145\/2332432.2332453","10.1145\/2332432"],"URL":"https:\/\/doi.org\/10.1145\/2332432.2332453","relation":{},"subject":[],"published":{"date-parts":[[2012,7,16]]},"assertion":[{"value":"2012-07-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}