Oblivious transfer and privacy amplification (Q1879418): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00145-002-0146-4 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Jozef Vyskoč / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Jozef Vyskoč / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00145-002-0146-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033966971 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00145-002-0146-4 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:17, 16 December 2024

scientific article
Language Label Description Also known as
English
Oblivious transfer and privacy amplification
scientific article

    Statements

    Oblivious transfer and privacy amplification (English)
    0 references
    0 references
    0 references
    0 references
    22 September 2004
    0 references
    One-of-the-two \(k\)-bits string oblivious transfer (OT) is an important cryptographic primitive, and it is already known that string OT may be directly reduced to one-of-two bits OT. In the paper a new approach to the reduction problem is presented. The new construction makes use of the privacy amplification technique -- the approach allows for a simpler, more general and more efficient protocol, but at the cost of a small probability of failure. Another advantage of the technique over the previous approaches is that it allows for reducing string OT to (apparently) much weaker primitives such as generalized OT or universal OT. Thus, the privacy amplification method is better than previously used methods provided that one is willing to accept an exponentially small probability of failure.
    0 references
    information-theoretic security
    0 references
    oblivious transfer
    0 references
    privacy amplification
    0 references
    information-theoretic reductions between primitives
    0 references
    0 references

    Identifiers