On Robust Combiners for Oblivious Transfer and Other Primitives

DOI10.1007/11426639_6zbMath1137.94346OpenAlexW2164987725MaRDI QIDQ5385724

Alon Rosen, Moni Naor, Danny Harnik, Joe Kilian, Omer Reingold

Publication date: 6 May 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11426639_6

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Three-round secure multiparty computation from black-box two-round oblivious transfer ⋮ Secure computation using leaky correlations (asymptotically optimal constructions) ⋮ Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement ⋮ Secure Computation from Leaky Correlated Randomness ⋮ Proofs of Work from worst-case assumptions ⋮ A complete one-way function based on a finite rank free \(\mathbb{Z}\times\mathbb{Z}\)-module ⋮ From FE combiners to secure MPC and back ⋮ Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge ⋮ Random oracle combiners: breaking the concatenation barrier for collision-resistance ⋮ One-time programs from commodity hardware ⋮ List oblivious transfer and applications to round-optimal black-box multiparty coin tossing ⋮ Feebly secure cryptographic primitives ⋮ Circuit complexity of linear functions: gate elimination and feeble security ⋮ Error-Tolerant Combiners for Oblivious Primitives ⋮ Structural complexity of AvgBPP ⋮ Oblivious transfer from trapdoor permutations in minimal rounds ⋮ Gate Elimination for Linear Functions and New Feebly Secure Constructions ⋮ On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography ⋮ The complexity of explicit constructions ⋮ On the complexity of compressing obfuscation ⋮ Compression from Collisions, or Why CRHF Combiners Have a Long Output ⋮ Multi-property Preserving Combiners for Hash Functions ⋮ OT-Combiners via Secure Computation ⋮ On complete one-way functions ⋮ High-performance multi-party computation for binary circuits based on oblivious transfer ⋮ Algebraic cryptography: new constructions and their security against provable break ⋮ Robust multi-property combiners for hash functions ⋮ Combiners for Chosen-Ciphertext Security ⋮ Combiners for functional encryption, unconditionally ⋮ Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages ⋮ A Feebly Secure Trapdoor Function ⋮ Structural Complexity of AvgBPP ⋮ Network Oblivious Transfer ⋮ Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption ⋮ Obfuscation Combiners ⋮ Authenticated Byzantine Generals in Dual Failure Model ⋮ On Complete Primitives for Fairness