Reducibility and Completeness in Private Computations

DOI10.1137/S0097539797321742zbMath0947.68009MaRDI QIDQ4943863

Eyal Kushilevitz, Silvio Micali, Rafail Ostrovsky, Joe Kilian

Publication date: 19 March 2000

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

zbMATH Keywords

reducibilitycompletenessprivate computationoblivious-transfer

Mathematics Subject Classification ID

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

Related Items

Completeness for symmetric two-party functionalities: revisited ⋮ Secret Swarm Unit Reactive k −Secret Sharing ⋮ Accelerating Oblivious Transfer with Batch Multi-exponentiation ⋮ On Complete Primitives for Fairness