Universally Composable Multi-party Computation Using Tamper-Proof Hardware
From MaRDI portal
Publication:5429386
DOI10.1007/978-3-540-72540-4_7zbMath1141.94360MaRDI QIDQ5429386
Publication date: 29 November 2007
Published in: Advances in Cryptology - EUROCRYPT 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72540-4_7
94A60: Cryptography
Related Items
Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model, Isolated Proofs of Knowledge and Isolated Zero Knowledge, David and Goliath Commitments: UC Computation for Asymmetric Parties 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, 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, UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens, Compact and Efficient UC Commitments Under Atomic-Exchanges, Universally Composable Firewall Architectures Using Trusted Hardware, Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens, Secure Outsourced Computation, 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, One-Time Programs, Resettably Secure Computation
