Reducibility and Completeness in Private Computations

DOI10.1137/S0097539797321742MaRDI QIDQ4943863zbMATH OpenFDO

Authors Joe Kilian, Eyal Kushilevitz, Silvio Micali, Rafail Ostrovsky

Publication date 19 March 2000

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539797321742

zbMATH Keywords

completenessoblivious-transferprivate computationreducibility

Mathematics Subject Classification ID

Network protocols (68M12) Data encryption (aspects in computer science) (68P25) Theory of computing (68Q99) Combinatorics in computer science (68R05) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Private Computations over the Integers
• Completeness theorems with constructive proofs for finite deterministic 2-party functions
• scientific article; zbMATH DE number 4191075
• A Zero-One Law for Boolean Privacy
• On private computation in incomplete networks

Cited in

(5)

• On reductions from multi-domain noninterference to the two-level case
• Completeness for symmetric two-party functionalities: revisited
• Accelerating oblivious transfer with batch multi-exponentiation
• On complete primitives for fairness
• Secret Swarm Unit Reactive k −Secret Sharing

This page was built for publication: Reducibility and Completeness in Private Computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943863)