Truly efficient string oblivious transfer using resettable tamper-proof tokens
From MaRDI portal
Recommendations
- (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens
- General Statistically Secure Computation with Bounded-Resettable Hardware Tokens
- Founding Cryptography on Tamper-Proof Hardware Tokens
- Efficient oblivious transfer protocols
Cites work
- Advances in Cryptology - CRYPTO 2003
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Efficient oblivious transfer protocols
- Efficient Two Party and Multi Party Computation Against Covert Adversaries
- Founding Cryptography on Tamper-Proof Hardware Tokens
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- scientific article; zbMATH DE number 1617945 (Why is no real title available?)
- scientific article; zbMATH DE number 1722674 (Why is no real title available?)
- scientific article; zbMATH DE number 4191102 (Why is no real title available?)
- scientific article; zbMATH DE number 3856987 (Why is no real title available?)
- scientific article; zbMATH DE number 1030984 (Why is no real title available?)
- scientific article; zbMATH DE number 1759348 (Why is no real title available?)
- Information-theoretically secure protocols and security under composition
- Isolated Proofs of Knowledge and Isolated Zero Knowledge
- New Constructions for UC Secure Computation Using Tamper-Proof Hardware
- One-Time Programs
- Resettably Secure Computation
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
- Theory of Cryptography
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware
- Universally Composable Multiparty Computation with Partially Isolated Parties
Cited in
(9)- Pattern matching on encrypted streams
- Non-interactive secure computation from one-way functions
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens
- Weakening the isolation assumption of tamper-proof hardware tokens
- Secure outsourced computation
- Secure set intersection with untrusted hardware tokens
- Founding Cryptography on Tamper-Proof Hardware Tokens
- Unconditional UC-secure computation with (stronger-malicious) PUFs
- Quadratic multiparty randomized encodings beyond honest majority and their applications
This page was built for publication: Truly efficient string oblivious transfer using resettable tamper-proof tokens
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3408203)
