Secure computation using leaky correlations (asymptotically optimal constructions)

DOI10.1007/978-3-030-03810-6_2zbMath1430.94058OpenAlexW2899913052MaRDI QIDQ1631316

Alexander R. Block, Hemanta K. Maji, Divya Gupta, Hai H. Nguyen

Publication date: 6 December 2018

Full work available at URL: https://doi.org/10.1007/978-3-030-03810-6_2

Related Items (3)

Secure computation using leaky correlations (asymptotically optimal constructions) ⋮ Asymptotically quasi-optimal cryptography ⋮ Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
On multiplication in finite fields
On the asymptotic behaviour of some towers of function fields over finite fields
Secure computation using leaky correlations (asymptotically optimal constructions)
Secure arithmetic computation with constant computational overhead
Secure computation based on leaky correlations: high resilience setting
Resource-efficient OT combiners with active security
Computationally secure oblivious transfer
Security and composition of multiparty cryptographic protocols
Multiparty Computation from Somewhat Homomorphic Encryption
A New Approach to Practical Active-Secure Two-Party Computation
Small-Bias Probability Spaces: Efficient Constructions and Applications
Secure Computation from Leaky Correlated Randomness
Error-Tolerant Combiners for Oblivious Primitives
Correcting errors without leaking partial information
Oblivious Transfer Is Symmetric
Robuster Combiners for Oblivious Transfer
Founding Cryptography on Oblivious Transfer – Efficiently
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
Simple Constructions of Almost k-wise Independent Random Variables
Random Cayley graphs and expanders
Tiny families of functions with random properties: A quality-size trade-off for hashing
Garbled Circuits as Randomized Encodings of Functions: a Primer
Extracting Correlations
On Robust Combiners for Oblivious Transfer and Other Primitives
OT-Combiners via Secure Computation
On Robust Combiners for Private Information Retrieval and Other Primitives
Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
Algebraic complexities and algebraic curves over finite fields

This page was built for publication: Secure computation using leaky correlations (asymptotically optimal constructions)