Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model

DOI10.1007/978-3-662-54388-7_15zbMath1400.94149OpenAlexW2583877491MaRDI QIDQ5738764

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Antigoni Polychroniadou

Publication date: 13 June 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-54388-7_15

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity ⋮ Unclonable polymers and their cryptographic applications ⋮ Efficient and round-optimal oblivious transfer and commitment with adaptive security ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model

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
• A proof of security of Yao's protocol for two-party computation
• Adaptive versus non-adaptive security of multi-party protocols
• 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
• Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE)
• Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
• Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments
• Concurrently Secure Computation in Constant Rounds
• Adaptively Secure Multi-Party Computation with Dishonest Majority
• On Adaptively Secure Protocols
• Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens
• Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token
• Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
• Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
• Founding Cryptography on Tamper-Proof Hardware Tokens
• Round-Optimal Black-Box Two-Party Computation
• Universally composable two-party and multi-party secure computation
• New notions of security
• Universally Composable Security with Global Setup
• One-Time Programs
• Founding Cryptography on Oblivious Transfer – Efficiently
• Simple, Black-Box Constructions of Adaptively Secure Protocols
• Black-Box Constructions of Two-Party Protocols from One-Way Functions
• Software protection and simulation on oblivious RAMs
• Implementing Resettable UC-Functionalities with Untrusted Tamper-Proof Hardware-Tokens
• A unified framework for concurrent security
• General Statistically Secure Computation with Bounded-Resettable Hardware Tokens
• Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
• Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds
• Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• Universally Composable Multi-party Computation Using Tamper-Proof Hardware
• David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
• New Constructions for UC Secure Computation Using Tamper-Proof Hardware
• Public Key Cryptography - PKC 2005
• (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens

This page was built for publication: Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model