Oblivious transfers and intersecting codes
From MaRDI portal
Publication:3129464
DOI10.1109/18.556673zbMath0873.94015OpenAlexW2123789695MaRDI QIDQ3129464
Gilles Brassard, Miklos Santha, Claude Crépeau
Publication date: 27 April 1997
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/8098dc28df1cbf00901600ed3e1b9a999fc859dc
Cryptography (94A60) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Related Items
Two-round MPC: information-theoretic and black-box, Quantum Key Distribution and String Oblivious Transfer in Noisy Channels, Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement, Variations on Minimal Linear Codes, On perfectly secure two-party computation for symmetric functionalities with correlated randomness, Generalized oblivious transfer by secret sharing, Oblivious transfer from trapdoor permutations in minimal rounds, Structures and lower bounds for binary covering arrays, Optimal Reductions Between Oblivious Transfers Using Interactive Hashing, Information-Theoretic Conditions for Two-Party Secure Function Evaluation, On perfectly secure 2PC in the OT-hybrid model, On perfectly secure 2PC in the OT-hybrid model, Strengthening the Security of Distributed Oblivious Transfer, Founding Cryptography on Tamper-Proof Hardware Tokens, Protecting data privacy in private information retrieval schemes, Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification, Large Sets of Orthogonal Arrays and Multimagic Squares, On the constructions of highly nonlinear zigzag functions and unbiased functions, Oblivious transfer based on single-qubit rotations, Yet another variation on minimal linear codes, On the state of strength-three covering arrays
