{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T15:48:46Z","timestamp":1756309726490,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T00:00:00Z","timestamp":1405382400000},"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":[[2014,7,15]]},"DOI":"10.1145\/2611462.2611490","type":"proceedings-article","created":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T12:20:56Z","timestamp":1405426856000},"page":"10-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Asynchronous MPC with a strict honest majority using non-equivocation"],"prefix":"10.1145","author":[{"given":"Michael","family":"Backes","sequence":"first","affiliation":[{"name":"CISPA, Saarland University, Saarbruecken, Germany"}]},{"given":"Fabian","family":"Bendun","sequence":"additional","affiliation":[{"name":"CISPA, Saarland University, Saarbruecken, Germany"}]},{"given":"Ashish","family":"Choudhury","sequence":"additional","affiliation":[{"name":"International Institute of Information Technology, Bangalore, Bangalore, India"}]},{"given":"Aniket","family":"Kate","sequence":"additional","affiliation":[{"name":"MMCI, Saarland University, Saarbruecken, Germany"}]}],"member":"320","published-online":{"date-parts":[[2014,7,15]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36095-4_17"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_32"},{"key":"e_1_3_2_1_4_1","first-page":"420","volume-title":"CRYPTO","author":"Beaver D.","year":"1991","unstructured":"D. Beaver . Efficient Multiparty Protocols Using Circuit Randomization . In CRYPTO , pages 420 -- 432 , 1991 . D. Beaver. Efficient Multiparty Protocols Using Circuit Randomization. In CRYPTO, pages 420--432, 1991."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1781454.1781486"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1802614.1802632"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835698.1835746"},{"key":"e_1_3_2_1_8_1","first-page":"390","volume-title":"CRYPTO","author":"Bellare M.","year":"1992","unstructured":"M. Bellare and O. Goldreich . On Defining Proofs of Knowledge . In CRYPTO , pages 390 -- 420 , 1992 . M. Bellare and O. Goldreich. On Defining Proofs of Knowledge. In CRYPTO, pages 390--420, 1992."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167109"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/197917.198088"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_39"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/800222.806743"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586124"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/646766.704283"},{"key":"e_1_3_2_1_16_1","volume-title":"Proof Systems for General Statements about Discrete Logarithms. Technical report","author":"Camenisch J.","year":"1997","unstructured":"J. Camenisch and M. Stadler . Proof Systems for General Statements about Discrete Logarithms. Technical report , 1997 . 260, Dept. of Computer Science , ETH Zurich. J. Camenisch and M. Stadler. Proof Systems for General Statements about Discrete Logarithms. Technical report, 1997. 260, Dept. of Computer Science, ETH Zurich."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62214"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11745853_7"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41527-2_27"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294280"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332490"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1774088.1774187"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.14"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/277697.277716"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_28_1","volume-title":"USA","author":"Hadzilacos V.","year":"1994","unstructured":"V. Hadzilacos and S. Toueg . A Modular Approach to Fault-Tolerant Broadcasts and Related Problems. Technical report, Ithaca, NY , USA , 1994 . V. Hadzilacos and S. Toueg. A Modular Approach to Fault-Tolerant Broadcasts and Related Problems. Technical report, Ithaca, NY, USA, 1994."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_28"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_19"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_39"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332491"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168866"},{"key":"e_1_3_2_1_34_1","first-page":"1","volume-title":"NSDI","author":"Levin D.","year":"2009","unstructured":"D. Levin , J. R. Douceur , J. R. Lorch , and T. Moscibroda . TrInc: Small Trusted Hardware for Large Distributed Systems . In NSDI , pages 1 -- 14 , 2009 . D. Levin, J. R. Douceur, J. R. Lorch, and T. Moscibroda. TrInc: Small Trusted Hardware for Large Distributed Systems. In NSDI, pages 1--14, 2009."},{"key":"e_1_3_2_1_35_1","first-page":"129","volume-title":"CRYPTO","author":"Pedersen T. P.","year":"1991","unstructured":"T. P. Pedersen . Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing . In CRYPTO , pages 129 -- 140 , 1991 . T. P. Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In CRYPTO, pages 129--140, 1991."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73014"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/1754495.1754519"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/800222.806744"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/1382436.1382751"}],"event":{"name":"PODC '14: 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"],"location":"Paris France","acronym":"PODC '14"},"container-title":["Proceedings of the 2014 ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2611462.2611490","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2611462.2611490","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:33Z","timestamp":1750230093000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2611462.2611490"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,15]]},"references-count":38,"alternative-id":["10.1145\/2611462.2611490","10.1145\/2611462"],"URL":"https:\/\/doi.org\/10.1145\/2611462.2611490","relation":{},"subject":[],"published":{"date-parts":[[2014,7,15]]},"assertion":[{"value":"2014-07-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}