Founding Cryptography on Tamper-Proof Hardware Tokens
From MaRDI portal
Recommendations
- On key agreement protocols based on tamper-proof hardware
- Weakening the isolation assumption of tamper-proof hardware tokens
- Basing cryptographic protocols on tamper-evident seals
- Automata, Languages and Programming
- Unconditional and composable security using a single stateful Tamper-proof hardware token
- New PKI Protocols Using Tamper Resistant Hardware
- Implementing resettable UC-functionalities with untrusted tamper-proof hardware-tokens
- Functional encryption from (small) hardware tokens
Cites work
- A minimal model for secure computation (extended abstract)
- A Zero-One Law for Boolean Privacy
- Advances in Cryptology - CRYPTO 2003
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Automata, Languages and Programming
- David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
- Foundations of Cryptography
- Founding Cryptography on Oblivious Transfer – Efficiently
- scientific article; zbMATH DE number 3856987 (Why is no real title available?)
- scientific article; zbMATH DE number 4051007 (Why is no real title available?)
- scientific article; zbMATH DE number 1256767 (Why is no real title available?)
- scientific article; zbMATH DE number 1024065 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- scientific article; zbMATH DE number 1394320 (Why is no real title available?)
- Implications of superstrong non-locality for cryptography
- Isolated Proofs of Knowledge and Isolated Zero Knowledge
- New Constructions for UC Secure Computation Using Tamper-Proof Hardware
- Oblivious transfers and intersecting codes
- One-Time Programs
- Privacy and Communication Complexity
- Private Circuits II: Keeping Secrets in Tamperable Circuits
- Resettable zero-knowledge (extended abstract)
- Resettably Secure Computation
- Software protection and simulation on oblivious RAMs
- Statistically-hiding commitment from any one-way function
- Theory of Cryptography
- Truly efficient string oblivious transfer using resettable tamper-proof tokens
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware
- Universally composable zero-knowledge arguments and commitments from signature cards
Cited in
(49)- Pattern matching on encrypted streams
- Non-interactive secure computation from one-way functions
- Obfuscating circuits via composite-order graded encoding
- Topology-hiding computation for networks with unknown delays
- Succinct non-interactive secure computation
- 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
- Basing cryptographic protocols on tamper-evident seals
- On the power of secure two-party computation
- Universally composable secure computation with corrupted tokens
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens
- On the exact round complexity of best-of-both-worlds multi-party computation
- On the Power of Secure Two-Party Computation
- Adaptively secure garbled circuits from one-way functions
- Weakening the isolation assumption of tamper-proof hardware tokens
- Encoding functions with constant online rate, or how to compress garbled circuit keys
- Unconditional and composable security using a single stateful Tamper-proof hardware token
- Secure outsourced computation
- Cryptography meets hardware: selected topics of hardware-based cryptography (invited talk)
- Secure set intersection with untrusted hardware tokens
- BiTR: built-in tamper resilience
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
- Delegating RAM computations with adaptive soundness and privacy
- Truly efficient string oblivious transfer using resettable tamper-proof tokens
- How to Compute in the Presence of Leakage
- One-time programs with limited memory
- From stateful hardware to resettable hardware using symmetric assumptions
- New PKI Protocols Using Tamper Resistant Hardware
- Interactive locking, zero-knowledge PCPs, and unconditional cryptography
- Implementing resettable UC-functionalities with untrusted tamper-proof hardware-tokens
- Garbled circuits as randomized encodings of functions: a primer
- Storing and retrieving secrets on a blockchain
- Secure computation using leaky tokens
- Secure computation without computers
- Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
- Lattice-based SNARGs and their application to more efficient obfuscation
- Cryptographic Hardware and Embedded Systems - CHES 2004
- 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
- One-time programs from commodity hardware
- On the correlation complexity of MPC with cheater identification
- CaSCaDE: (time-based) Cryptography from Space Communications DElay
- Improved black-box constructions of composable secure computation
- Towards building scalable constant-round MPC from minimal assumptions via round collapsing
- Proofs of sequential communication delays from physical assumptions and their applications
- Powerful primitives in the bounded quantum storage model
This page was built for publication: Founding Cryptography on Tamper-Proof Hardware Tokens
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3408202)
