• Corpus ID: 10673744

Brief Introduction to Provable Security

  title={Brief Introduction to Provable Security},
  author={Michel Abdalla},
The primary goal of cryptography is to enable parties to communicate securely over an insecure channel, which may be under the control of an adversary. Though originally used mainly for the purpose of protecting the privacy of messages, cryptography now encompasses many other goals, such as guaranteeing the integrity of messages being exchanged or the authenticity of the sender. For most of its history, cryptography was essentially a game played between designers and attackers in which one side… 

Figures from this paper


The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
It is demonstrated that for DES parameters (56-bit keys and 64-bit plaintexts) an adversary's maximal advantage against triple encryption is small until it asks about 278 queries.
Probabilistic Encryption
Communication theory of secrecy systems
  • C. Shannon
  • Computer Science, Mathematics
    Bell Syst. Tech. J.
  • 1949
A theory of secrecy systems is developed on a theoretical level and is intended to complement the treatment found in standard works on cryptography.
New directions in cryptography
This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
Identity-Based Encryption from the Weil Pairing
This work proposes a fully functional identity-based encryption scheme (IBE) based on the Weil pairing that has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational Diffie-Hellman problem.
A public key cryptosystem and a signature scheme based on discrete logarithms
The invention pertains to a novel method of forming a flexible, tapered end on a thermoplastic molding strip that is flexible and virtually free of residual stress which may cause a strip to delaminate when applied to a desired substratum.
A One Round Protocol for Tripartite Diffie–Hellman
  • A. Joux
  • Mathematics, Computer Science
    Journal of Cryptology
  • 2004
A three participants variation of the Diffie--Hellman protocol is proposed, based on the Weil and Tate pairings on elliptic curves, which were first used in cryptography as cryptanalytic tools for reducing the discrete logarithm problem on some elliptic curve to the discreteLogarithms problem in a finite field.
Since at most T of these equations can come from (7), at least (m T) of them come from (8’). Thus, for the distribution (PI’, . . . , p,‘), at most T of the probabilities are nonzero. The proof of
Journal of Computer and System Sciences Special Issue on Query Answering on Graph-Structured Data