Theory of cryptography | Cryptography

Provable security

Provable security refers to any type or level of computer security that can be proved. It is used in different ways by different fields. Usually, this refers to mathematical proofs, which are common in cryptography. In such a proof, the capabilities of the attacker are defined by an adversarial model (also referred to as attacker model): the aim of the proof is to show that the attacker must solve the underlying hard problem in order to break the security of the modelled system. Such a proof generally does not consider side-channel attacks or other implementation-specific attacks, because they are usually impossible to model without implementing the system (and thus, the proof only applies to this implementation). Outside of cryptography, the term is often used in conjunction with secure coding and security by design, both of which can rely on proofs to show the security of a particular approach. As with the cryptographic setting, this involves an attacker model and a model of the system. For example, code can be verified to match the intended functionality, described by a model: this can be done through static checking. These techniques are sometimes used for evaluating products (see Common Criteria): the security here depends not only on the correctness of the attacker model, but also on the model of the code. Finally, the term provable security is sometimes used by sellers of security software that are attempting to sell security products like firewalls, antivirus software and intrusion detection systems. As these products are typically not subject to scrutiny, many security researchers consider this type of claim to be selling snakeoil. (Wikipedia).

Video thumbnail

Network Security, Part 1 : Basic Encryption Techniques

Fundamental concepts of network security are discussed. It provides a good overview of secret Key and public key Encryption. Important data encryption standards are presented.

From playlist Network Security

Video thumbnail

Network Security: Classical Encryption Techniques

Fundamental concepts of encryption techniques are discussed. Symmetric Cipher Model Substitution Techniques Transposition Techniques Product Ciphers Steganography

From playlist Network Security

Video thumbnail

Intrusion Detection: Part 2

Fundamental concepts of intrusion detection are discussed. Various types of intrusion are analyzed. Password management is explained.

From playlist Network Security

Video thumbnail

CERIAS Security: Sphinx: A Compact and Provably Secure Mix Format 3/6

Clip 3/6 Speaker: Ian Goldberg · University of Waterloo Mix networks, originally proposed in 1981, provide a way for Internet users to send messages--such as email, blog posts, or tweets--without automatically revealing their identities or their locations. In this talk, we will describe

From playlist The CERIAS Security Seminars 2009

Video thumbnail

Intrusion Detection: Part 1

Fundamental concepts of intrusion detection are discussed. Various types of intrusion are analyzed. Password management is explained.

From playlist Network Security

Video thumbnail

How to keep your online accounts secure

What exactly is a "secure account"? Learn what account security is and why it’s so important to keep your accounts secure.

From playlist Internet Safety

Video thumbnail

CERIAS Security: Provable security in mobile ad hoc networks 5/6

Clip 5/6 Speaker: Mike Burmester · Florida State Mobile ad hoc networks (MANETs) are collections of wireless mobile nodes with links that are made or broken in an arbitrary way. Communication is achieved via routes whose node relay packets. Several routing algorithms have been propose

From playlist The CERIAS Security Seminars 2006

Video thumbnail

CERIAS Security: Provable security in mobile ad hoc networks 1/6

Clip 1/6 Speaker: Mike Burmester · Florida State Mobile ad hoc networks (MANETs) are collections of wireless mobile nodes with links that are made or broken in an arbitrary way. Communication is achieved via routes whose node relay packets. Several routing algorithms have been propose

From playlist The CERIAS Security Seminars 2006

Video thumbnail

Computer Basics: Protecting Your Computer

There are many different online threats that you need to be aware of. In this video, we're going to show you some of these threats and talk about how to protect the files and personal data that you have stored on your computer. We hope you enjoy! For more info, check out our written less

From playlist Starting out with Technology

Video thumbnail

What can I do to protect my account?

Learn how you can use tools such as two-step verifications, password managers, and security checkups to proactively keep your accounts secure.

From playlist Internet Safety

Video thumbnail

CERIAS Security: Sphinx: A Compact and Provably Secure Mix Format 6/6

Clip 6/6 Speaker: Ian Goldberg · University of Waterloo Mix networks, originally proposed in 1981, provide a way for Internet users to send messages--such as email, blog posts, or tweets--without automatically revealing their identities or their locations. In this talk, we will describe

From playlist The CERIAS Security Seminars 2009

Video thumbnail

CERIAS Security: Provable security in mobile ad hoc networks 6/6

Clip 6/6 Speaker: Mike Burmester · Florida State Mobile ad hoc networks (MANETs) are collections of wireless mobile nodes with links that are made or broken in an arbitrary way. Communication is achieved via routes whose node relay packets. Several routing algorithms have been propose

From playlist The CERIAS Security Seminars 2006

Video thumbnail

CERIAS Security: Provable security in mobile ad hoc networks 3/6

Clip 3/6 Speaker: Mike Burmester · Florida State Mobile ad hoc networks (MANETs) are collections of wireless mobile nodes with links that are made or broken in an arbitrary way. Communication is achieved via routes whose node relay packets. Several routing algorithms have been propose

From playlist The CERIAS Security Seminars 2006

Video thumbnail

CERIAS Security: Provable security in mobile ad hoc networks 2/6

Clip 2/6 Speaker: Mike Burmester · Florida State Mobile ad hoc networks (MANETs) are collections of wireless mobile nodes with links that are made or broken in an arbitrary way. Communication is achieved via routes whose node relay packets. Several routing algorithms have been propose

From playlist The CERIAS Security Seminars 2006

Video thumbnail

CERIAS Security: Sphinx: A Compact and Provably Secure Mix Format 1/6

Clip 1/6 Speaker: Ian Goldberg · University of Waterloo Mix networks, originally proposed in 1981, provide a way for Internet users to send messages--such as email, blog posts, or tweets--without automatically revealing their identities or their locations. In this talk, we will describe

From playlist The CERIAS Security Seminars 2009

Video thumbnail

CERIAS Security: Provable security in mobile ad hoc networks 4/6

Clip 4/6 Speaker: Mike Burmester · Florida State Mobile ad hoc networks (MANETs) are collections of wireless mobile nodes with links that are made or broken in an arbitrary way. Communication is achieved via routes whose node relay packets. Several routing algorithms have been propose

From playlist The CERIAS Security Seminars 2006

Video thumbnail

IP Security: Part 1

Fundamental concepts of IPSec are discussed. Authentication Header is explained. ESP & IKE are analyzed.

From playlist Network Security

Video thumbnail

CERIAS Security: Obfuscated Databases: Definitions and Constructions 2/6

Clip 2/6 Speaker: Vitaly Shmatikov · University of Texas at Austin I will present some new definitions and constructions for privacy in large databases. In contrast to conventional privacy mechanisms that aim to prevent any access to individual records, our techniques are designed to

From playlist The CERIAS Security Seminars 2005 (1)

Related pages

Security parameter | Computational hardness assumption | One-way function | Semantic security | Snake oil (cryptography) | Quadratic residuosity problem | Computational complexity theory | Computer security | Adversary (cryptography) | Concrete security | Static program analysis | Cryptography