On black-box complexity of universally composable security in the CRS model

DOI10.1007/S00145-019-09326-YzbMath1466.94027OpenAlexW2944114059MaRDI QIDQ2318086

Muthuramakrishnan Venkitasubramaniam, Carmit Hazay

Publication date: 13 August 2019

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-019-09326-y

zbMATH Keywords

oblivious transferblack-box constructionsUC commitmentsUC secure computation

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth projective hashing and two-message oblivious transfer
• Composition of secure multi-party protocols. A comprehensive study.
• A unified approach to constructing black-box UC protocols in trusted setup models
• Concurrent composition of secure protocols in the timing model
• On the limitations of universally composable two-party computation without set-up assumptions
• On Black-Box Complexity of Universally Composable Security in the CRS Model
• Unconditionally Secure and Universally Composable Commitments from Physical Assumptions
• Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments
• Analysis and Improvement of Lindell’s UC-Secure Commitment Schemes
• Black-Box Constructions of Composable Protocols without Set-Up
• Black-box constructions for secure computation
• Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption
• Black-Box Constructions of Protocols for Secure Computation
• How to share a secret
• On the Necessary and Sufficient Assumptions for UC Computation
• Universally composable two-party and multi-party secure computation
• Non-interactive and reusable non-malleable commitment schemes
• A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security
• Universally Composable Security with Global Setup
• A Framework for Efficient and Composable Oblivious Transfer
• Founding Cryptography on Oblivious Transfer – Efficiently
• Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
• Simple, Black-Box Constructions of Adaptively Secure Protocols
• Black-Box Constructions of Two-Party Protocols from One-Way Functions
• Adaptively Secure Two-Party Computation with Erasures
• Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
• Foundations of Cryptography
• A Unified Framework for UC from Only OT
• Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS
• A unified framework for concurrent security
• Universally Composable Oblivious Transfer from Lossy Encryption and the McEliece Assumptions
• Advances in Cryptology – CRYPTO 2004
• Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
• Universally Composable Oblivious Transfer Based on a Variant of LPN
• One-Sided Adaptively Secure Two-Party Computation

This page was built for publication: On black-box complexity of universally composable security in the CRS model