Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions

DOI10.1007/978-3-662-53641-4_16zbMath1406.94061OpenAlexW2538269074MaRDI QIDQ3179365

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam

Publication date: 21 December 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-662-53641-4_16

zbMATH Keywords

zero-one lawblack-box constructioncoin-tossingUC securityadaptive secure computationextractable commitments

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model ⋮ Concurrently Composable Security with Shielded Super-Polynomial Simulators ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ On the Power of Secure Two-Party Computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adaptive zero-knowledge proofs and adaptively secure oblivious transfer
• Bit commitment using pseudorandomness
• 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
• Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
• Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments
• Round-Efficient Black-Box Construction of Composable Multi-Party Computation
• Black-Box Constructions of Composable Protocols without Set-Up
• On Adaptively Secure Protocols
• New notions of security
• A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security
• Universally Composable Security with Global Setup
• Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
• Founding Cryptography on Oblivious Transfer – Efficiently
• Simple, Black-Box Constructions of Adaptively Secure Protocols
• Nonmalleable Cryptography
• Revisiting Lower and Upper Bounds for Selective Decommitments
• A unified framework for concurrent security
• Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
• Concurrent Non-malleable Commitments from Any One-Way Function
• Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol
• Theory of Cryptography

This page was built for publication: Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions