Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
From MaRDI portal
Publication:3179364
DOI10.1007/978-3-662-53641-4_15zbMATH Open1406.94060OpenAlexW2535311203MaRDI QIDQ3179364FDOQ3179364
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
Cites Work
- Bit commitment using pseudorandomness
- Title not available (Why is that?)
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- Founding Cryptography on Oblivious Transfer – Efficiently
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
- Advances in Cryptology – CRYPTO 2004
- On the limitations of universally composable two-party computation without set-up assumptions
- Universally composable two-party and multi-party secure computation
- New notions of security
- Universally Composable Security with Global Setup
- Title not available (Why is that?)
- Title not available (Why is that?)
- A unified framework for concurrent security
- Founding Cryptography on Tamper-Proof Hardware Tokens
- Advances in Cryptology - CRYPTO 2003
- The Exact Round Complexity of Secure Computation
- Zero-Knowledge Proofs from Secure Multiparty Computation
- Adaptively Secure Garbled Circuits from One-Way Functions
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- Concurrent composition of secure protocols in the timing model
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware
- 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
- Concurrent Non-Malleable Commitments (and More) in 3 Rounds
- Round-Optimal Black-Box Two-Party Computation
- Two-Round Secure MPC from Indistinguishability Obfuscation
- Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token
- From Stateful Hardware to Resettable Hardware Using Symmetric Assumptions
- David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
- New Constructions for UC Secure Computation Using Tamper-Proof Hardware
- Online/Offline OR Composition of Sigma Protocols
- (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens
- A Unified Framework for UC from Only OT
- Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments
- General Statistically Secure Computation with Bounded-Resettable Hardware Tokens
- Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model
- On Black-Box Complexity of Universally Composable Security in the CRS Model
- Implementing Resettable UC-Functionalities with Untrusted Tamper-Proof Hardware-Tokens
- Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens
Cited In (15)
- Succinct non-interactive secure computation
- Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs
- Round-optimal secure multi-party computation
- Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model
- Formal Abstractions for Attested Execution Secure Processors
- Secure Hardware Implementation of Non-linear Functions in the Presence of Glitches
- Everlasting UC commitments from fully malicious PUFs
- Adaptive hardness and composable security in the plain model from standard assumptions
- Unclonable polymers and their cryptographic applications
- An Efficient PIR Construction Using Trusted Hardware
- Fully-secure MPC with minimal trust
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens
- Pattern matching on encrypted streams
- Lower Bounds in the Hardware Token Model
- Non-interactive secure computation from one-way functions
Recommendations
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware 👍 👎
- Hardware Private Circuits: From Trivial Composition to Full Verification 👍 👎
- New Constructions for UC Secure Computation Using Tamper-Proof Hardware 👍 👎
- Theory of Cryptography 👍 👎
- Unconditional and composable security using a single stateful Tamper-proof hardware token 👍 👎
- A minimal model for secure computation (extended abstract) 👍 👎
- Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model 👍 👎
- Adaptive hardness and composable security in the plain model from standard assumptions 👍 👎
- Securing Circuits and Protocols against 1/poly(k) Tampering Rate 👍 👎
- An Architecture for Provably Secure Computation 👍 👎
This page was built for publication: Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179364)
