security and cryptography By Alexander W. Dent Information Security Group,...  Home/Search
Context
Related
| iacr.org/2006/278.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/2006/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper examines methods for formally proving the security of cryptographic schemes. We show that, despite many years of active research, there are fundamental problems which have yet to be solved. We also present a new approach to one of the more controversial aspects of provable security: the random oracle model (Update)
Active bibliography (related documents): More All
0.3: The Hardness of the DHK Problem in the - Generic Group Model (2006) (Correct)
0.2: Another Look At Generic Groups - Neal Koblitz And (2006) (Correct)
0.2: A Survey of Certificateless Encryption Schemes - And Security Models (2006) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ security-fundamental,
author = "Security And Cryptography",
title = "Fundamental Problems in Provable",
url = "citeseer.ist.psu.edu/759996.html" }
Citations (may not include all citations):659 Random oracles are practical: a paradigm for designing e#cie.. - Bellare, Rogaway - 1993
501 A digital signature scheme secure against adaptive chosen-me.. - Goldwasser, Micali et al. - 1988
241 Communication theory of secrecy systems (context) - Shannon - 1949
189 Universally composable security: A new paradigm for cryptogr.. - Canetti - 2001
167 The random oracle methodology (context) - Cannetti, Goldreich et al. - 2004
159 A concrete security treatment of symmetric encryption (context) - Bellare, Desai et al. - 1997
124 Lower bounds for discrete logarithms and related problems - Shoup - 1997
109 Digitalized signatures and public-key functions as intractab.. (context) - Rabin - 1979
77 Composition and integrity preservation of secure reactive sy.. - Pfitzmann, Waidner - 2000
56 How to go beyond the black-box simulation barrier - Barak - 2001
56 Universally composable commitments - Canetti, Fischlin - 2001
49 possibility of obfuscating programs (context) - Barak, Goldrecih et al. - 2001
46 Design and analysis of practical public-key encryption schem.. - ACM, Cramer et al. - 2003
46 Short signatures without random oracles - Boneh, Boyen - 2004
31 Practice-oriented provable-security - Bellare - 1997
31 New directions in cryptography (context) - Hellman - 1976
20 Separating random oracle proofs from complexity theoretic pr.. (context) - Nielsen - 2002
11 provable security (context) - Koblitz, Menezes - 2004
7 Adapting the weaknesses of the random oracle model to the ge.. - Dent - 2002
6 Towards plaintext-aware public-key encryption without random.. (context) - Bellare, Palacio - 2004
1 Relations among notions for public-key encryption schemes (context) - Bellare, Desai et al. - 1998
1 Springer-Verlag Lecture Notes in Computer Science (context) - Fumy - 1936
1 Springer-Verlag Lectures Notes in Computer Science (context) - Feigenbaum - 1948
1 Non-interactive zero-knowledge proof of knowledge and chosen.. (context) - no, LCS et al. - 1991
Documents on the same site (http://eprint.iacr.org/2006/): More
Simplified Pairing Computation and Security Implications - Galbraith, hEigeartaigh.. (2006) (Correct)
Cryptanalysis of an Image Scrambling Scheme without.. - Li, Li, Lo, Chen (2006) (Correct)
Non-Trivial Black-Box Combiners for Collision-Resistant.. - Pietrzak (2006) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC