Sciweavers

220 search results - page 37 / 44
» Formally Certifying the Security of Digital Signature Scheme...
Sort
View
CCS
2005
ACM
14 years 1 months ago
Towards computationally sound symbolic analysis of key exchange protocols
d abstract) Prateek Gupta and Vitaly Shmatikov The University of Texas at Austin We present a cryptographically sound formal method for proving correctness of key exchange protoco...
Prateek Gupta, Vitaly Shmatikov
ESORICS
2009
Springer
14 years 8 months ago
User-Centric Handling of Identity Agent Compromise
Digital identity credentials are a key enabler for important online services, but widespread theft and misuse of such credentials poses serious risks for users. We believe that an ...
Daisuke Mashima, Mustaque Ahamad, Swagath Kannan
ICIP
2005
IEEE
14 years 9 months ago
Localization and security enhancement of block-based image authentication
Most block-based image authentication techniques that are presented in the literature sacrifice localization accuracy in order to resist vector quantization (VQ) counterfeiting att...
Abdelkader H. Ouda, Mahmoud R. El-Sakka
CSR
2009
Springer
14 years 2 months ago
A Feebly Secure Trapdoor Function
Abstract. In 1992, A. Hiltgen [1] provided the first constructions of provably (slightly) secure cryptographic primitives, namely feebly one-way functions. These functions are pro...
Edward A. Hirsch, Sergey I. Nikolenko
EUROCRYPT
2010
Springer
14 years 13 days ago
Cryptographic Agility and Its Relation to Circular Encryption
We initiate a provable-security treatment of cryptographic agility. A primitive (for example PRFs, authenticated encryption schemes or digital signatures) is agile when multiple, ...
Tolga Acar, Mira Belenkiy, Mihir Bellare, David Ca...