Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
From MaRDI portal
Publication:3179364
DOI10.1007/978-3-662-53641-4_15zbMath1406.94060OpenAlexW2535311203MaRDI QIDQ3179364
Antigoni Polychroniadou, 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_15
Related Items (11)
Pattern matching on encrypted streams ⋮ Everlasting UC commitments from fully malicious PUFs ⋮ Unclonable polymers and their cryptographic applications ⋮ (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens ⋮ Fully-secure MPC with minimal trust ⋮ Non-interactive secure computation from one-way functions ⋮ Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model ⋮ Formal Abstractions for Attested Execution Secure Processors ⋮ Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs ⋮ Round-optimal secure multi-party computation ⋮ Succinct non-interactive secure computation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Improved OR-Composition of Sigma-Protocols
- Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
- On the Power of Secure Two-Party Computation
- Adaptively Secure Garbled Circuits from One-Way Functions
- Concurrent Non-Malleable Commitments (and More) in 3 Rounds
- Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments
- Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens
- Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token
- Founding Cryptography on Tamper-Proof Hardware Tokens
- Round-Optimal Black-Box Two-Party Computation
- From Stateful Hardware to Resettable Hardware Using Symmetric Assumptions
- Zero-Knowledge Proofs from Secure Multiparty Computation
- Universally composable two-party and multi-party secure computation
- New notions of security
- Universally Composable Security with Global Setup
- Founding Cryptography on Oblivious Transfer – Efficiently
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- Implementing Resettable UC-Functionalities with Untrusted Tamper-Proof Hardware-Tokens
- A Unified Framework for UC from Only OT
- A unified framework for concurrent security
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
- General Statistically Secure Computation with Bounded-Resettable Hardware Tokens
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology - CRYPTO 2003
- 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
- Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model
- Online/Offline OR Composition of Sigma Protocols
- The Exact Round Complexity of Secure Computation
- Two-Round Secure MPC from Indistinguishability Obfuscation
- (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens
This page was built for publication: Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
