{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:41:29Z","timestamp":1750308089012,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,11,11]],"date-time":"2005-11-11T00:00:00Z","timestamp":1131667200000},"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":[[2005,11,11]]},"DOI":"10.1145\/1103576.1103579","type":"proceedings-article","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T15:52:40Z","timestamp":1139241160000},"page":"13-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["On fairness in simulatability-based cryptographic systems"],"prefix":"10.1145","author":[{"given":"Michael","family":"Backes","sequence":"first","affiliation":[{"name":"IBM Zurich Research Lab, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dennis","family":"Hofheinz","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Karlsruhe, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rn","family":"M\u00fcller-Quade","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Karlsruhe, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Unruh","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Karlsruhe, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,11,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/800222.806740"},{"key":"e_1_3_2_1_2_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/978-3-540-45187-7_23","volume-title":"Concurrency Theory, Proceedings of CONCUR","author":"Backes M.","year":"2003","unstructured":"M. Backes . Unifying simulatability definitions in cryptographic systems under different timing assumptions . In R. Amadio and D. Lugiez, editors, Concurrency Theory, Proceedings of CONCUR 2003 , volume 2761 of Lecture Notes in Computer Science , pages 350 -- 365 . Springer-Verlag , 2003. Full version online available at http:\/\/eprint.iacr.org\/2003\/114.ps.]] M. Backes. Unifying simulatability definitions in cryptographic systems under different timing assumptions. In R. Amadio and D. Lugiez, editors, Concurrency Theory, Proceedings of CONCUR 2003, volume 2761 of Lecture Notes in Computer Science, pages 350--365. Springer-Verlag, 2003. Full version online available at http:\/\/eprint.iacr.org\/2003\/114.ps.]]"},{"key":"e_1_3_2_1_3_1","volume-title":"Aug.","author":"Backes M.","year":"2005","unstructured":"M. Backes , D. Hofheinz , J. M\u00fcller-Quade , and D. Unruh . On fairness in simulatability-based cryptographic systems , Aug. 2005 . IACR ePrint 2005\/294.]] M. Backes, D. Hofheinz, J. M\u00fcller-Quade, and D. Unruh. On fairness in simulatability-based cryptographic systems, Aug. 2005. IACR ePrint 2005\/294.]]"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/794201.795170"},{"key":"e_1_3_2_1_5_1","volume-title":"Mar.","author":"Backes M.","year":"2004","unstructured":"M. Backes , B. Pfitzmann , and M. Waidner . Secure asynchronous reactive systems. IACR ePrint Archive , Mar. 2004 . Online available at http:\/\/eprint.iacr.org\/2004\/082.ps.]] M. Backes, B. Pfitzmann, and M. Waidner. Secure asynchronous reactive systems. IACR ePrint Archive, Mar. 2004. Online available at http:\/\/eprint.iacr.org\/2004\/082.ps.]]"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167109"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/4221.214134"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586124"},{"key":"e_1_3_2_1_9_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1007\/3-540-44647-8_31","volume-title":"Advances in Cryptology, Proceedings of CRYPTO","author":"Cachin C.","year":"2001","unstructured":"C. Cachin , K. Kursawe , F. Petzold , and V. Shoup . Secure and efficient asynchronous broadcast protocols . In J. Kilian, editor, Advances in Cryptology, Proceedings of CRYPTO 2001 , volume 2139 of Lecture Notes in Computer Science , pages 524 -- 541 . Springer-Verlag , 2001.]] C. Cachin, K. Kursawe, F. Petzold, and V. Shoup. Secure and efficient asynchronous broadcast protocols. In J. Kilian, editor, Advances in Cryptology, Proceedings of CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 524--541. Springer-Verlag, 2001.]]"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875553"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509980"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01843568"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/588058.588060"},{"key":"e_1_3_2_1_16_1","volume-title":"Jan.","author":"Garay J. A.","year":"2004","unstructured":"J. A. Garay , P. MacKenzie , and K. Yang . Efficient and secure multi-party computation with faulty majority and complete fairness. IACR ePrint Archive , Jan. 2004 . Online available at http:\/\/eprint.iacr.org\/2004\/009\/.]] J. A. Garay, P. MacKenzie, and K. Yang. Efficient and secure multi-party computation with faulty majority and complete fairness. IACR ePrint Archive, Jan. 2004. Online available at http:\/\/eprint.iacr.org\/2004\/009\/.]]"},{"key":"e_1_3_2_1_17_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/3-540-36108-1_2","volume-title":"Distributed Computing, 16th International Conference, DISC","author":"Goldwasser S.","year":"2002","unstructured":"S. Goldwasser and Y. Lindell . Secure computation without agreement . In D. Malkhi, editor, Distributed Computing, 16th International Conference, DISC 2002 , Toulouse, France, October 28-30, 2002 Proceedings, volume 2508 of Lecture Notes in Computer Science , pages 17 -- 32 . Springer , 2002.]] S. Goldwasser and Y. Lindell. Secure computation without agreement. In D. Malkhi, editor, Distributed Computing, 16th International Conference, DISC 2002, Toulouse, France, October 28-30, 2002 Proceedings, volume 2508 of Lecture Notes in Computer Science, pages 17--32. Springer, 2002.]]"},{"key":"e_1_3_2_1_18_1","volume-title":"Jan.","author":"Hofheinz D.","year":"2004","unstructured":"D. Hofheinz and J. M\u00fcller-Quade . A synchronous model for multi-party computation and the incompleteness of oblivious transfer. IACR ePrint Archive , Jan. 2004 . Online available at http:\/\/eprint.iacr.org\/2004\/016.ps.]] D. Hofheinz and J. M\u00fcller-Quade. A synchronous model for multi-party computation and the incompleteness of oblivious transfer. IACR ePrint Archive, Jan. 2004. Online available at http:\/\/eprint.iacr.org\/2004\/016.ps.]]"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.2005.22"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/882495.884436"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.45"}],"event":{"name":"CCS05: 12th ACM Conference on Computer and Communications Security 2005","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control","ACM Association for Computing Machinery"],"location":"Fairfax VA USA","acronym":"CCS05"},"container-title":["Proceedings of the 2005 ACM workshop on Formal methods in security engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1103576.1103579","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1103576.1103579","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:07:52Z","timestamp":1750262872000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1103576.1103579"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11,11]]},"references-count":21,"alternative-id":["10.1145\/1103576.1103579","10.1145\/1103576"],"URL":"https:\/\/doi.org\/10.1145\/1103576.1103579","relation":{},"subject":[],"published":{"date-parts":[[2005,11,11]]},"assertion":[{"value":"2005-11-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}