On the Necessary and Sufficient Assumptions for UC Computation

DOI10.1007/978-3-642-11799-2_8zbMath1274.94060OpenAlexW1529116701MaRDI QIDQ3408190

Claudio Orlandi, Jesper Buus Nielsen, Ivan B. Damgård

Publication date: 24 February 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-11799-2_8

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Impossibility results for universal composability in public-key models and with fixed inputs ⋮ Universally Composable Private Proximity Testing ⋮ On black-box complexity of universally composable security in the CRS model ⋮ Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge

Cites Work

• Impossibility results for universal composability in public-key models and with fixed inputs
• Resettable zero-knowledge (extended abstract)
• Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
• Universally composable two-party and multi-party secure computation
• Non-interactive and reusable non-malleable commitment schemes
• Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
• Founding Cryptography on Oblivious Transfer – Efficiently
• Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
• A unified framework for concurrent security
• Theory of Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Necessary and Sufficient Assumptions for UC Computation