Universally Composable Multi-party Computation Using Tamper-Proof Hardware
From MaRDI portal
Recommendations
- New Constructions for UC Secure Computation Using Tamper-Proof Hardware
- Distributing the setup in universally composable multi-party computation
- Universally Composable Multiparty Computation with Partially Isolated Parties
- New notions of security: achieving universal composability without trusted setup
- David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
Cited in
(50)- General composition and universal composability in secure multiparty computation
- Pattern matching on encrypted streams
- Another step towards realizing random oracles: non-malleable point obfuscation
- Non-interactive secure computation from one-way functions
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
- Everlasting UC commitments from fully malicious PUFs
- Unclonable polymers and their cryptographic applications
- Feasibility and infeasibility of secure computation with malicious PUFs
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens
- On the limitations of universally composable two-party computation without set-up assumptions
- Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
- UC commitments for modular protocol design and applications to revocation and attribute tokens
- Universal composability from essentially any trusted setup
- Compact and efficient UC commitments under atomic-exchanges
- Distributing the setup in universally composable multi-party computation
- Universally composable firewall architectures using trusted hardware
- Weakening the isolation assumption of tamper-proof hardware tokens
- Secure outsourced computation
- Cryptography meets hardware: selected topics of hardware-based cryptography (invited talk)
- Secure set intersection with untrusted hardware tokens
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
- Founding Cryptography on Tamper-Proof Hardware Tokens
- Truly efficient string oblivious transfer using resettable tamper-proof tokens
- Concurrent secure computation via non-black box simulation
- Concurrent secure computation with optimal query complexity
- Universally composable two-party and multi-party secure computation
- New notions of security: achieving universal composability without trusted setup
- One-Time Programs
- Universally Composable Multiparty Computation with Partially Isolated Parties
- Resettably Secure Computation
- scientific article; zbMATH DE number 2009949 (Why is no real title available?)
- Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions
- Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
- Universally Composable Multi-party Computation with an Unreliable Common Reference String
- Isolated Proofs of Knowledge and Isolated Zero Knowledge
- David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
- New Constructions for UC Secure Computation Using Tamper-Proof Hardware
- Universally Composable Security Analysis of TLS
- Constant round adaptively secure protocols in the tamper-proof hardware model
- Formal abstractions for attested execution secure processors
- Concurrently composable security with shielded super-polynomial simulators
- Unconditional UC-secure computation with (stronger-malicious) PUFs
- Fully-secure MPC with minimal trust
- Lifting standard model reductions to common setup assumptions
- On concurrent multi-party quantum computation
- Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model
- CaSCaDE: (time-based) Cryptography from Space Communications DElay
- Improved black-box constructions of composable secure computation
- Proofs of sequential communication delays from physical assumptions and their applications
- A new paradigm for server-aided MPC
This page was built for publication: Universally Composable Multi-party Computation Using Tamper-Proof Hardware
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5429386)
