Pages that link to "Item:Q3408202"

The following pages link to Founding Cryptography on Tamper-Proof Hardware Tokens (Q3408202):

Displaying 30 items.

• Secure computation without computers (Q517015) (← links)
• Pattern matching on encrypted streams (Q1633445) (← links)
• Non-interactive secure computation from one-way functions (Q1710666) (← links)
• Obfuscating circuits via composite-order graded encoding (Q2039401) (← links)
• Topology-hiding computation for networks with unknown delays (Q2055692) (← links)
• Succinct non-interactive secure computation (Q2119013) (← 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)
• On the power of secure two-party computation (Q2303458) (← links)
• Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation (Q2319626) (← links)
• (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens (Q2423844) (← links)
• On the exact round complexity of best-of-both-worlds multi-party computation (Q2691581) (← links)
• On the Power of Secure Two-Party Computation (Q2829222) (← links)
• Adaptively Secure Garbled Circuits from One-Way Functions (Q2829946) (← links)
• Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens (Q2947531) (← links)
• Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (Q2954373) (← 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)
• Delegating RAM Computations with Adaptive Soundness and Privacy (Q3181020) (← links)
• Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens (Q3408203) (← links)
• How to Compute in the Presence of Leakage (Q3449567) (← links)
• Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
• Storing and Retrieving Secrets on a Blockchain (Q5087260) (← links)
• Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software (Q5270360) (← links)
• Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (Q5270364) (← links)
• Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model (Q5738764) (← links)
• Formal Abstractions for Attested Execution Secure Processors (Q5738880) (← links)
• Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs (Q5738884) (← links)