Abstract:Probable security is an important criteria for analyzing the security of cryptographic protocols. However, writing and verifying proofs by hand are prone to errors. This paper introduces the game-based approach of writing security proofs and its automatic technique. It advocates the automatic security proof approach based on process calculus, and presents the initial game and observati...

The modern approach to cryptography is provable security, where one defines a meaningful formal security model and proves that schemes are secure in this model. An exception is the design of countermeasures against cryptographic sidechannel attacks, which even today is mostly based on heuristic arguments, which only try to prevent particular attacks. It was long believed that side-channels are ...

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...

Abstract: Investigations on the proof theory and methods of simultaneously provable security under multi-model helps to construct formally secure cryptographic scheme under multi-environments. Further research is provided on the construction of efficient IBE scheme and provable security under CCA model. Elementary investigations on pairing-based CCA secure IBE scheme which is provably secure ba...

Provable security is an important issue in modern cryptography because it satisfies the security of the encryption schemes in a theoretical way via a reduction method. To prove the security of a cryptographic scheme, it is necessarry to define the goals and the capabilities of the adversary. In this paper, we explain security models in terms of the adversarial goals and the adversarial capabili...

Sketchable security is shown to be a viable successor to provable security. Whereas security proofs can be found to have flaws, gaps, or to be just plain hard to interpret let alone understand, security sketches escape these problems. Moreover, security sketches can be made more plausible and understandable to a wider audience. This document describes some of the most salient points of sketchab...

Everyone knows that the one-time pad provides perfect security. But what does this mean? In this chapter, we make this concept precise. Also, we know that it is very difficult in practice to produce a truly random key for a one-time pad. In Section 2, we show quantitatively how biases in producing the key affect the security of the encryption. The topics of this chapter are part of the subject ...