{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T03:58:54Z","timestamp":1769313534586,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,13]],"date-time":"2004-06-13T00:00:00Z","timestamp":1087084800000},"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":[[2004,6,13]]},"DOI":"10.1145\/1007352.1007394","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T15:55:38Z","timestamp":1090338938000},"page":"242-251","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":92,"title":["New notions of security"],"prefix":"10.1145","author":[{"given":"Manoj","family":"Prabhakaran","sequence":"first","affiliation":[{"name":"Princeton University, Princeton, NJ"}]},{"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ"}]}],"member":"320","published-online":{"date-parts":[[2004,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"FOCS 2002: 345--355]]","author":"Barak Boaz","unstructured":"Boaz Barak . Constant-Round Coin-Tossing with a Man in the Middle or Realizing the Shared Random String Model . FOCS 2002: 345--355]] Boaz Barak. Constant-Round Coin-Tossing with a Man in the Middle or Realizing the Shared Random String Model. FOCS 2002: 345--355]]"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Boaz Barak and Yehuda Lindell. Strict Polynomial-time in Simulation and Extraction. Electronic Colloquium on Computational Complexity (ECCC)(026): (2002)]] Boaz Barak and Yehuda Lindell. Strict Polynomial-time in Simulation and Extraction. Electronic Colloquium on Computational Complexity (ECCC)(026): (2002)]]","DOI":"10.1145\/509907.509979"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Ran Canetti. Universally composable security: A new paradigm for cryptographic protocols. Electronic Colloquium on Computational Complexity (ECCC) (016): (2001) (Preliminary version in IEEE Symposium on Foundations of Computer Science pages 136--145 2001. )]] Ran Canetti. Universally composable security: A new paradigm for cryptographic protocols. Electronic Colloquium on Computational Complexity (ECCC) (016): (2001) (Preliminary version in IEEE Symposium on Foundations of Computer Science pages 136--145 2001. )]]","DOI":"10.1109\/SFCS.2001.959888"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/646766.704151"},{"key":"e_1_3_2_1_5_1","volume-title":"Canetti and Hugo Krawczyk. Universally Composable Notions of Key Exchange and Secure Channels. EUROCRYPT 2002: 337--351","author":"Ran","unstructured":"Ran Canetti and Hugo Krawczyk. Universally Composable Notions of Key Exchange and Secure Channels. EUROCRYPT 2002: 337--351 .]] Ran Canetti and Hugo Krawczyk. Universally Composable Notions of Key Exchange and Secure Channels. EUROCRYPT 2002: 337--351.]]"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1766171.1766178"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509980"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780605"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276722"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795291562"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276853"},{"key":"e_1_3_2_1_12_1","volume-title":"DISC 2002: 17--32]]","author":"Goldwasser S.","unstructured":"S. Goldwasser and Y. Lindell . Secure Computation without Agreement . DISC 2002: 17--32]] S. Goldwasser and Y. Lindell. Secure Computation without Agreement. DISC 2002: 17--32]]"},{"key":"e_1_3_2_1_13_1","volume-title":"Preliminary version","author":"Multi-Party Computation Secure","year":"1998","unstructured":"Secure Multi-Party Computation . Manuscript. Preliminary version , 1998 . Available from: http:\/\/www. wisdom. weizmann. ac. il\/ oded\/pp. html.]] Secure Multi-Party Computation. Manuscript. Preliminary version, 1998. Available from: http:\/\/www. wisdom. weizmann. ac. il\/ oded\/pp. html.]]"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73010"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380851"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780641"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946294"},{"issue":"2","key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"Naor Moni","unstructured":"Moni Naor . Bit Commitment using Pseudorandom Generators . Journal of Cryptology , 4 ( 2 ): 151 -- 158 , 1991.]] Moni Naor. Bit Commitment using Pseudorandom Generators. Journal of Cryptology, 4(2):151--158, 1991.]]","journal-title":"Cryptology"},{"key":"e_1_3_2_1_20_1","volume-title":"EUROCRYPT 2003: 160--176","author":"Pass Rafael","unstructured":"Rafael Pass . Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition . EUROCRYPT 2003: 160--176 .]] Rafael Pass. Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition. EUROCRYPT 2003: 160--176.]]"},{"key":"e_1_3_2_1_21_1","volume-title":"FOCS 2003: 404--413","author":"Pass Rafael","unstructured":"Rafael Pass and Alon Rosen . Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds . FOCS 2003: 404--413 .]] Rafael Pass and Alon Rosen. Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds. FOCS 2003: 404--413.]]"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/352600.352639"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/882495.884436"},{"key":"e_1_3_2_1_24_1","volume-title":"Alon Rosen and Amit Sahai. Concurrent Zero Knowledge with Logarithmic Round-Complexity. FOCS 2002: 366--375]]","author":"Prabhakaran Manoj","unstructured":"Manoj Prabhakaran , Alon Rosen and Amit Sahai. Concurrent Zero Knowledge with Logarithmic Round-Complexity. FOCS 2002: 366--375]] Manoj Prabhakaran, Alon Rosen and Amit Sahai. Concurrent Zero Knowledge with Logarithmic Round-Complexity. FOCS 2002: 366--375]]"},{"key":"e_1_3_2_1_25_1","volume-title":"New Notions of Security: Achieving Universal Composability without Trusted Setup. At the Cryptology ePrint Archive http:\/\/eprint. iacr. org\/","author":"Prabhakaran Manoj","year":"2004","unstructured":"Manoj Prabhakaran and Amit Sahai . New Notions of Security: Achieving Universal Composability without Trusted Setup. At the Cryptology ePrint Archive http:\/\/eprint. iacr. org\/ . 2004 .]] Manoj Prabhakaran and Amit Sahai. New Notions of Security: Achieving Universal Composability without Trusted Setup. At the Cryptology ePrint Archive http:\/\/eprint. iacr. org\/. 2004.]]"},{"key":"e_1_3_2_1_26_1","unstructured":"Manoj Prabhakaran and Amit Sahai. Revisiting Concurrency: Monitored Functionalities and Client-Server Computation. Manuscript under preparation.]] Manoj Prabhakaran and Amit Sahai. Revisiting Concurrency: Monitored Functionalities and Client-Server Computation. Manuscript under preparation.]]"},{"key":"e_1_3_2_1_27_1","volume-title":"Sahai. Non-malleable Non-interactive Zero Knowledge and Adaptive Chosen Ciphertext Security. FOCS 1999: 543--553]]","author":"Amit","unstructured":"Amit Sahai. Non-malleable Non-interactive Zero Knowledge and Adaptive Chosen Ciphertext Security. FOCS 1999: 543--553]] Amit Sahai. Non-malleable Non-interactive Zero Knowledge and Adaptive Chosen Ciphertext Security. FOCS 1999: 543--553]]"},{"key":"e_1_3_2_1_28_1","volume-title":"Richardson and Joe Kilian. On the Concurrent Composition of Zero-Knowledge Proofs. EUROCRYPT 1999: 415--431]]","author":"Ransom","unstructured":"Ransom Richardson and Joe Kilian. On the Concurrent Composition of Zero-Knowledge Proofs. EUROCRYPT 1999: 415--431]] Ransom Richardson and Joe Kilian. On the Concurrent Composition of Zero-Knowledge Proofs. EUROCRYPT 1999: 415--431]]"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100269"}],"event":{"name":"STOC04: Symposium of Theory of Computing 2004","location":"Chicago IL USA","acronym":"STOC04","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the thirty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007352.1007394","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1007352.1007394","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:23:55Z","timestamp":1750267435000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007352.1007394"}},"subtitle":["achieving universal composability without trusted setup"],"short-title":[],"issued":{"date-parts":[[2004,6,13]]},"references-count":29,"alternative-id":["10.1145\/1007352.1007394","10.1145\/1007352"],"URL":"https:\/\/doi.org\/10.1145\/1007352.1007394","relation":{},"subject":[],"published":{"date-parts":[[2004,6,13]]},"assertion":[{"value":"2004-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}