| Document Date: 2011-01-14 14:00:36
Open Document File Size: 341,94 KBShare Result on Facebook
Company q-Hidden LRSW Comp / Google / Microsoft / / Currency USD / / Facility Simple Assumptions Matthew Green∗ Johns Hopkins University Susan Hohenberger† Johns Hopkins University / store O / / Holiday Assumption / / IndustryTerm larger applications / selection algorithm / fullysimulatable protocol / ith algorithm / adaptive protocols / interactive decryption protocol / non-adaptive protocol / et al. protocol / decryption protocol / folklore solution / prior protocols / trivial solution / larger database applications / blind key extraction protocol / adaptive oblivious transfer protocol / elegant and efficient blind decryption protocol / blind decryption protocol / k×1 protocol / / Organization G8 / National Science Foundation / G. Figure / Johns Hopkins University / / Position extractor / knowledge extractor / RT / / Product Boneh-Boyen IBE / encrypt using the Boneh-Boyen IBE / / ProvinceOrState Rhode Island / / Technology encryption / selection algorithm / non-adaptive OT protocols / two-party protocol / underlying OT protocol / prior protocols / k-out-of-N adaptive OT protocol / constructing adaptive protocols / ith algorithm / adaptive oblivious transfer protocol / public key / typically interactive / 4-round protocols / adaptive OT protocols / decryption protocol / adaptive OTN k×1 protocol / 1-out-of-N non-adaptive OT protocol / OT protocol / PoK protocols / interactive decryption protocol / SDH / 3.2 The Construction Our OTN k×1 protocol / SI algorithm / secret key / adaptive OT protocol / non-adaptive protocol / simulation / blind key extraction protocol / blind decryption protocol / VerifyCiphertext algorithm / interactive protocol / Camenisch et al. protocol / /
SocialTag |
Practical Adaptive Oblivious Transfer from Simple Assumptions Matthew Green∗ Johns Hopkins University Susan Hohenberger† Johns Hopkins University