Pages that link to "Item:Q5429386"
From MaRDI portal
The following pages link to Universally Composable Multi-party Computation Using Tamper-Proof Hardware (Q5429386):
Displaying 35 items.
- General composition and universal composability in secure multiparty computation (Q1027983) (← links)
- Pattern matching on encrypted streams (Q1633445) (← links)
- Another step towards realizing random oracles: non-malleable point obfuscation (Q1648795) (← links)
- Non-interactive secure computation from one-way functions (Q1710666) (← links)
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration (Q2128558) (← links)
- Everlasting UC commitments from fully malicious PUFs (Q2155992) (← links)
- Unclonable polymers and their cryptographic applications (Q2170032) (← links)
- Feasibility and infeasibility of secure computation with malicious PUFs (Q2175217) (← links)
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens (Q2423844) (← links)
- UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens (Q2829948) (← links)
- Compact and Efficient UC Commitments Under Atomic-Exchanges (Q2942848) (← links)
- Universally Composable Firewall Architectures Using Trusted Hardware (Q2947101) (← links)
- Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens (Q2947531) (← links)
- Secure Outsourced Computation (Q3011899) (← links)
- Secure Set Intersection with Untrusted Hardware Tokens (Q3073691) (← links)
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity (Q3179364) (← links)
- Founding Cryptography on Tamper-Proof Hardware Tokens (Q3408202) (← links)
- Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens (Q3408203) (← links)
- Concurrent Secure Computation via Non-Black Box Simulation (Q3457058) (← links)
- Concurrent Secure Computation with Optimal Query Complexity (Q3457059) (← links)
- One-Time Programs (Q3600212) (← links)
- Resettably Secure Computation (Q3627427) (← links)
- Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions (Q4924440) (← links)
- Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model (Q5026392) (← links)
- Isolated Proofs of Knowledge and Isolated Zero Knowledge (Q5458611) (← links)
- David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware (Q5458612) (← links)
- Universally Composable Security Analysis of TLS (Q5505479) (← links)
- Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model (Q5738764) (← links)
- Formal Abstractions for Attested Execution Secure Processors (Q5738880) (← links)
- Concurrently Composable Security with Shielded Super-Polynomial Simulators (Q5738883) (← links)
- Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs (Q5738884) (← links)
- Fully-secure MPC with minimal trust (Q6114281) (← links)
- Lifting standard model reductions to common setup assumptions (Q6169031) (← links)
- Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model (Q6488035) (← links)
- CaSCaDE: (time-based) Cryptography from Space Communications DElay (Q6660393) (← links)
