Universally Composable Multi-party Computation with an Unreliable Common Reference String

DOI10.1007/978-3-540-78524-8_9MaRDI QIDQ5445503zbMATH OpenOpenAlexFDO

Authors Vipul Goyal, Jonathan Katz

Publication date 5 March 2008

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78524-8_9

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Universally composable two-party and multi-party secure computation
• Universally Composable Multi-party Computation Using Tamper-Proof Hardware
• On black-box complexity of universally composable security in the CRS model
• New notions of security: achieving universal composability without trusted setup
• On Black-Box Complexity of Universally Composable Security in the CRS Model

Cited in

(9)

• Universally composable two-party and multi-party secure computation
• Universally Composable Multiparty Computation with Partially Isolated Parties
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• A Note on Universal Composable Zero Knowledge in Common Reference String Model
• A note on universal composable zero-knowledge in the common reference string model
• Cryptography in the multi-string model
• Towards accountability in CRS generation
• Cryptography in the Multi-string Model
• Towards accountability in CRS generation

This page was built for publication: Universally Composable Multi-party Computation with an Unreliable Common Reference String

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5445503)