On Black-Box Complexity and Adaptive, Universal Composability of Cryptographic Tasks
Two main goals of modern cryptography are to identify the minimal assumptions necessary to construct secure cryptographic primitives as well as to construct secure protocols in strong and realistic adversarial models. In this thesis, we address both of these fundamental questions. In the first part...
Main Author: | Dachman-Soled, Dana |
---|---|
Language: | English |
Published: |
2011
|
Subjects: | |
Online Access: | https://doi.org/10.7916/D8K64R2W |
Similar Items
-
On Universally Composable KEM, DEM and Three Cryptographic Channels
by: Nagao, Waka
Published: (2010) -
Adaptive algorithms for problems involving black-box Lipschitz functions
by: Baran, Ilya, 1981-
Published: (2005) -
Differentially-Private Multi-Party Sketching for Large-Scale Statistics
by: Choi Seung Geol, et al.
Published: (2020-07-01) -
Cryptographic tools for the cloud
by: Gorbunov, Sergey
Published: (2015) -
Cryptographic error correction
by: Peikert, Christopher Jason
Published: (2007)