Secure computation from leaky correlated randomness
From MaRDI portal
Recommendations
- Secure computation based on leaky correlations: high resilience setting
- Secure computation using leaky correlations (asymptotically optimal constructions)
- On the power of correlated randomness in secure computation
- Extracting correlations
- On the orthogonal vector problem and the feasibility of unconditionally secure leakage-resilient computation
Cites work
- A new approach to practical active-secure two-party computation
- After-the-fact leakage in public-key encryption
- Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
- Constructing locally computable extractors and cryptosystems in the bounded-storage model
- Error-Tolerant Combiners for Oblivious Primitives
- Founding Cryptography on Oblivious Transfer – Efficiently
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Generalized privacy amplification
- scientific article; zbMATH DE number 3771502 (Why is no real title available?)
- Leakage-resilient circuits without computational assumptions
- Leakage-Tolerant Interactive Protocols
- Masking against Side-Channel Attacks: A Formal Security Proof
- On Robust Combiners for Oblivious Transfer and Other Primitives
- On Robust Combiners for Private Information Retrieval and Other Primitives
- On the asymptotic behaviour of some towers of function fields over finite fields
- OT-Combiners via Secure Computation
- Privacy Amplification by Public Discussion
- Random Cayley graphs and expanders
- Robuster Combiners for Oblivious Transfer
- Secure computation against adaptive auxiliary information
- Tiny families of functions with random properties: A quality-size trade-off for hashing
- Unifying leakage models: from probing attacks to noisy leakage.
Cited in
(11)- Secure computation using leaky correlations (asymptotically optimal constructions)
- Secure computation based on leaky correlations: high resilience setting
- Secure non-interactive reduction and spectral analysis of correlations
- On the orthogonal vector problem and the feasibility of unconditionally secure leakage-resilient computation
- Leakage-Resilient Coin Tossing
- On the power of correlated randomness in secure computation
- Extracting correlations
- Unconditional UC-secure computation with (stronger-malicious) PUFs
- Correction to: ``Unconditionally secure computation against low-complexity leakage
- Almost tight multi-user security under adaptive corruptions \& leakages in the standard model
- Group Structure in Correlations and Its Applications in Cryptography.
This page was built for publication: Secure computation from leaky correlated randomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457091)
