Founding Cryptography on Tamper-Proof Hardware Tokens

DOI10.1007/978-3-642-11799-2_19zbMath1274.94072OpenAlexW1501386175MaRDI QIDQ3408202

Yuval Ishai, Vipul Goyal, Amit Sahai, Akshay Wadia, Ramarathnam Venkatesan

Publication date: 24 February 2010

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11799-2_19

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (31)

Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration ⋮ How to Compute in the Presence of Leakage ⋮ Pattern matching on encrypted streams ⋮ Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity ⋮ Delegating RAM Computations with Adaptive Soundness and Privacy ⋮ Everlasting UC commitments from fully malicious PUFs ⋮ Unclonable polymers and their cryptographic applications ⋮ Storing and Retrieving Secrets on a Blockchain ⋮ Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens ⋮ Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys ⋮ (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens ⋮ One-time programs from commodity hardware ⋮ On the exact round complexity of best-of-both-worlds multi-party computation ⋮ Non-interactive secure computation from one-way functions ⋮ Secure Outsourced Computation ⋮ Secure computation without computers ⋮ Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model ⋮ Formal Abstractions for Attested Execution Secure Processors ⋮ Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs ⋮ Obfuscating circuits via composite-order graded encoding ⋮ Secure Set Intersection with Untrusted Hardware Tokens ⋮ On the power of secure two-party computation ⋮ Topology-hiding computation for networks with unknown delays ⋮ On the Power of Secure Two-Party Computation ⋮ Adaptively Secure Garbled Circuits from One-Way Functions ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation ⋮ Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer ⋮ Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation ⋮ Succinct non-interactive secure computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A minimal model for secure computation (extended abstract)
• Oblivious transfers and intersecting codes
• Resettable zero-knowledge (extended abstract)
• Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens
• Implications of superstrong non-locality for cryptography
• Private Circuits II: Keeping Secrets in Tamperable Circuits
• One-Time Programs
• Founding Cryptography on Oblivious Transfer – Efficiently
• Resettably Secure Computation
• Privacy and Communication Complexity
• Software protection and simulation on oblivious RAMs
• Foundations of Cryptography
• Advances in Cryptology - CRYPTO 2003
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• Universally Composable Multi-party Computation Using Tamper-Proof Hardware
• 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
• Automata, Languages and Programming
• A Zero-One Law for Boolean Privacy
• Theory of Cryptography

This page was built for publication: Founding Cryptography on Tamper-Proof Hardware Tokens