Oblivious transfers and intersecting codes

DOI10.1109/18.556673MaRDI QIDQ3129464zbMATH OpenOpenAlexFDO

Authors Gilles Brassard, Claude Crépeau, Miklos Santha

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

zbMATH Keywords

algebraic-geometric codesinformation theoryintersecting codesoblivious transfer

Mathematics Subject Classification ID

Cryptography (94A60) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Recommendations

• Coding-Based Oblivious Transfer
• Coding Constructions for Efficient Oblivious Transfer From Noisy Channels
• On oblivious transfer capacity
• scientific article; zbMATH DE number 826067
• Laconic oblivious transfer and its applications
• Equivocable oblivious transfer
• scientific article; zbMATH DE number 4191102
• Oblivious transfer and polynomial evaluation
• Oblivious Transfer from Weak Noisy Channels
• Oblivious Transfer and Linear Functions

Cited in

(27)

• Protecting data privacy in private information retrieval schemes
• On the constructions of highly nonlinear zigzag functions and unbiased functions
• Two-round MPC: information-theoretic and black-box
• Yet another variation on minimal linear codes
• Oblivious transfer from trapdoor permutations in minimal rounds
• Large sets of orthogonal arrays and multimagic squares
• On the state of strength-three covering arrays
• Oblivious transfer from any non-trivial elastic noisy channel via secret key agreement
• Founding Cryptography on Tamper-Proof Hardware Tokens
• Quantum key distribution and string oblivious transfer in noisy channels
• Variations on minimal linear codes
• Optimal Reductions Between Oblivious Transfers Using Interactive Hashing
• Information-Theoretic Conditions for Two-Party Secure Function Evaluation
• Strengthening the Security of Distributed Oblivious Transfer
• Structures and lower bounds for binary covering arrays
• scientific article; zbMATH DE number 826067 (Why is no real title available?)
• Oblivious transfer based on single-qubit rotations
• Information Security Practice and Experience
• Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification
• Coding-Based Oblivious Transfer
• Oblivious Transfer and Linear Functions
• On perfectly secure 2PC in the OT-hybrid model
• On perfectly secure 2PC in the OT-hybrid model
• On perfectly secure two-party computation for symmetric functionalities with correlated randomness
• Generalized oblivious transfer by secret sharing
• Private computations on set intersection
• The geometry of intersecting codes and applications to additive combinatorics and factorization theory

This page was built for publication: Oblivious transfers and intersecting codes

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