other · Bulletin of Miscellaneous Information (Royal Gardens Kew) · 2008
Microsoft Research Video 103641: Deterministic Encryption: Theory and Applications
Microsoft Research
Cited by 0Abstract and details only
Abstract
The focus of the talk is deterministic public-key encryption schemes. Besides being interesting from theoretical and historical perspectives, the deterministic encryption primitive has applications to fast and secure search on remote data. We study several new notions of security for deterministic encryption and relations among them. We present several very efficient deterministic encryption schemes that provably satisfy the strongest-possible security definition (in the random oracle model). We finally provide the constructions that achieve security for many practical settings, without relying on the idealized random oracle model. The talk is based on joint papers with Mihir Bellare, Serge Fehr and Adam O'Neill. ©2008 Microsoft Corporation. All rights reserved.
Cite this paper
Research, M. (2008). Microsoft Research Video 103641: Deterministic Encryption: Theory and Applications. Bulletin of Miscellaneous Information (Royal Gardens Kew).
Research, Microsoft. “Microsoft Research Video 103641: Deterministic Encryption: Theory and Applications.” Bulletin of Miscellaneous Information (Royal Gardens Kew), 2008.
Research, Microsoft. 2008. “Microsoft Research Video 103641: Deterministic Encryption: Theory and Applications.” Bulletin of Miscellaneous Information (Royal Gardens Kew).
Research, M. (2008) ‘Microsoft Research Video 103641: Deterministic Encryption: Theory and Applications’, Bulletin of Miscellaneous Information (Royal Gardens Kew).
@misc{research2008microsoft,
title = {{Microsoft Research Video 103641: Deterministic Encryption: Theory and Applications}},
author = {Research, Microsoft},
journal = {Bulletin of Miscellaneous Information (Royal Gardens Kew)},
year = {2008}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.