Articles producció científica> Enginyeria Informàtica i Matemàtiques

One-Out-of-q OT Combiners

  • Identification data

    Identifier: imarina:9366242
  • Authors:

    Farras, Oriol
    Ribes-Gonzalez, Jordi
  • Others:

    Author, as appears in the article.: Farras, Oriol; Ribes-Gonzalez, Jordi
    Department: Enginyeria Informàtica i Matemàtiques
    URV's Author/s: Farràs Ventura, Oriol
    Keywords: Servers Secret sharing schemes Robust combiners Receivers Protocols Private information-retrieval Power Ot combiners Oblivious transfer Indexes Cryptography Costs Closed box
    Abstract: In 1-out-of- q Oblivious Transfer (OT) protocols, a sender Alice is able to send one of q >= 2 messages to a receiver Bob, all while being oblivious to which message was transferred. Moreover, the receiver learns only one of these messages. Oblivious Transfer combiners take n instances of OT protocols as input, and produce an OT protocol that is secure if sufficiently many of the n original OT instances are secure. We present new 1-out-of- q OT combiners that are perfectly secure against active adversaries. Our combiners arise from secret sharing techniques. We show that given an Fq -linear secret sharing scheme on a set of n participants and adversary structure A , we can construct an n -server, 1-out-of- q OT combiner that is secure against an adversary corrupting either Alice and a set of servers in A , or Bob and a set of servers B with B is not an element of A . If the normalized total share size of the scheme is & ell; , then the resulting OT combiner requires & ell; calls to OT protocols, and the total amount of bits exchanged during the protocol is (q(2)+q+1)& ell; logq . We also present a construction based on 1-out-of-2 OT combiners that uses the protocol of Cr & eacute;peau, Brassard and Robert (FOCS 1986). This construction provides smaller communication costs for certain adversary structures, such as threshold ones: For any prime power q >= n , there are n -server, 1-out-of- q OT combiners that are perfectly secure against active adversaries corrupting either Alice or Bob, and a minority of the OT candidates, exchanging O(qnlogq) bits in total.
    Thematic Areas: Matemática / probabilidade e estatística Library and information sciences Information systems Engineering, electrical & electronic Engenharias iv Engenharias iii Computer science, information systems Computer science applications Ciencias sociales Ciência da computação Astronomia / física
    licence for use: https://creativecommons.org/licenses/by/3.0/es/
    Author's mail: oriol.farras@urv.cat
    Author identifier: 0000-0002-7495-5980
    Record's date: 2024-07-20
    Papper version: info:eu-repo/semantics/acceptedVersion
    Link to the original source: https://ieeexplore.ieee.org/document/10347273
    Licence document URL: http://repositori.urv.cat/ca/proteccio-de-dades/
    Papper original source: Ieee Transactions On Information Theory. 70 (4): 2984-2998
    APA: Farras, Oriol; Ribes-Gonzalez, Jordi (2024). One-Out-of-<i>q</i> OT Combiners. Ieee Transactions On Information Theory, 70(4), 2984-2998. DOI: 10.1109/TIT.2023.3340294
    Article's DOI: 10.1109/TIT.2023.3340294
    Entity: Universitat Rovira i Virgili
    Journal publication year: 2024
    Publication Type: Journal Publications
  • Keywords:

    Computer Science Applications,Computer Science, Information Systems,Engineering, Electrical & Electronic,Information Systems,Library and Information Sciences
    Servers
    Secret sharing schemes
    Robust combiners
    Receivers
    Protocols
    Private information-retrieval
    Power
    Ot combiners
    Oblivious transfer
    Indexes
    Cryptography
    Costs
    Closed box
    Matemática / probabilidade e estatística
    Library and information sciences
    Information systems
    Engineering, electrical & electronic
    Engenharias iv
    Engenharias iii
    Computer science, information systems
    Computer science applications
    Ciencias sociales
    Ciência da computação
    Astronomia / física
  • Documents:

  • Cerca a google

    Search to google scholar