(Efficient) universally composable oblivious transfer using a minimal number of stateless tokens (Q2423844): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 21:01, 2 February 2024

scientific article
Language Label Description Also known as
English
(Efficient) universally composable oblivious transfer using a minimal number of stateless tokens
scientific article

    Statements

    (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 June 2019
    0 references
    secure computation
    0 references
    oblivious transfer
    0 references
    hardware tokens
    0 references
    universal composability
    0 references

    Identifiers