Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
From MaRDI portal
(Redirected from Publication:3179364)
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/\mathrm{poly}(k)\) tampering rate
- An Architecture for Provably Secure Computation
Cites work
- scientific article; zbMATH DE number 176562 (Why is no real title available?)
- scientific article; zbMATH DE number 2009954 (Why is no real title available?)
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens
- A unified framework for UC from only OT
- A unified framework for concurrent security
- Adaptive and concurrent secure computation from new adaptive, non-malleable commitments
- Adaptive hardness and composable security in the plain model from standard assumptions
- Adaptively secure garbled circuits from one-way functions
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology – CRYPTO 2004
- Bit commitment using pseudorandomness
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- Concurrent composition of secure protocols in the timing model
- Concurrent non-malleable commitments (and more) in 3 rounds
- Constant round adaptively secure protocols in the tamper-proof hardware model
- David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- Founding Cryptography on Oblivious Transfer – Efficiently
- Founding Cryptography on Tamper-Proof Hardware Tokens
- From stateful hardware to resettable hardware using symmetric assumptions
- General Statistically Secure Computation with Bounded-Resettable Hardware Tokens
- Implementing resettable UC-functionalities with untrusted tamper-proof hardware-tokens
- Improved OR-composition of sigma-protocols
- New Constructions for UC Secure Computation Using Tamper-Proof Hardware
- New notions of security: achieving universal composability without trusted setup
- On Black-Box Complexity of Universally Composable Security in the CRS Model
- On the Power of Secure Two-Party Computation
- On the limitations of universally composable two-party computation without set-up assumptions
- Online/offline OR composition of sigma protocols
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- Round-optimal black-box two-party computation
- The Exact Round Complexity of Secure Computation
- Two-round secure MPC from indistinguishability obfuscation
- Unconditional and composable security using a single stateful Tamper-proof hardware token
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware
- Universally Composable Security with Global Setup
- Universally composable two-party and multi-party secure computation
- Weakening the isolation assumption of tamper-proof hardware tokens
- Zero-knowledge proofs from secure multiparty computation
Cited in
(19)- Succinct non-interactive secure computation
- Round-optimal secure multi-party computation
- Unconditional and composable security using a single stateful Tamper-proof hardware token
- Secure Hardware Implementation of Non-linear Functions in the Presence of Glitches
- Unconditional UC-secure computation with (stronger-malicious) PUFs
- Everlasting UC commitments from fully malicious PUFs
- UC-secure multiparty computation from one-way functions using stateless tokens
- Improved black-box constructions of composable secure computation
- Constant round adaptively secure protocols in the tamper-proof hardware model
- 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
- Universally composable secure computation with corrupted tokens
- Formal abstractions for attested execution secure processors
- 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
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)
