Universally Composable Multiparty Computation with Partially Isolated Parties

DOI10.1007/978-3-642-00457-5_19zbMath1213.94097OpenAlexW1598324400MaRDI QIDQ3611774

Daniel Wichs, Jesper Buus Nielsen, Ivan B. Damgård

Publication date: 3 March 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-00457-5_19

zbMATH Keywords

multiparty computationuniversally composable securitypublic-key infrastructure

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (7)

Compact and Efficient UC Commitments Under Atomic-Exchanges ⋮ Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens ⋮ (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens ⋮ Isolated Proofs of Knowledge and Isolated Zero Knowledge ⋮ David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware ⋮ Secure Set Intersection with Untrusted Hardware Tokens ⋮ Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens

This page was built for publication: Universally Composable Multiparty Computation with Partially Isolated Parties