Cryptographic protocols Cryptographic protocols AKA stands for the Authentication and Key Agreement security protocol. It is a mechanism which performs authentication and session key distribution in Universal Mobile Telecommunications System (UMTS) networks. AKA is a challenge-response based mechanism that uses symmetric cryptography. AKA is typically run in a UMTS IM Services Identity Module (ISIM), which resides on a smart card like device that also provides tamper resistant storage of shared secrets. ...more on Wikipedia about "AKA (security)"
Alice and Bob are conventional placeholder terms referring to common archetypal characters used in explanations in fields such as cryptography and physics. The names are used for convenience, since explanations such as "Person A wants to send a message to person B" rapidly become difficult to follow. The names are also said to be politically correct, as they represent both genders. The concrete motive for using such names was that it helps with writing because it gives the personal pronouns unambiguous meanings. The specific names were chosen to match the first letters of the alphabet. ...more on Wikipedia about "Alice and Bob"
CCMP (Counter Mode with Cipher Block Chaining Message Authentication Code Protocol) is an IEEE 802.11i encryption protocol, created to replace WEP, an earlier, insecure protocol. CCMP uses the Advanced Encryption Standard (AES) algorithm. In the 802.11i standard, unlike WPA, key management and message integrity is handled by a single component CCMP built around AES. ...more on Wikipedia about "CCMP"
In public key infrastructure systems, a certificate signing request (also CSR or certification request) is a message sent from an applicant to a certificate authority in order to apply for a digital identity certificate. Before creating a CSR, the applicant first generates a key pair, keeping the private key secret. The CSR contains information identifying the applicant (such as a directory name in the case of an X.509 certificate), and the public key chosen by the applicant. The corresponding private key is not included in the CSR, but the entire request is digitally signed with the private key. The CSR may be accompanied by other credentials or proofs of identity required by the certificate authority, and the certificate authority may contact the applicant for further information. ...more on Wikipedia about "Certificate signing request"
The certification path validation algorithm is the algorithm which verifies that a given certificate path is valid under a given public key infrastructure. A path starts with the Subject certificate and proceeds through a number of intermediate certificates up to a trusted root certificate, typically issued by a trusted Certification Authority (CA). ...more on Wikipedia about "Certification path validation algorithm"
Chaffing and winnowing is a cryptographic technique to achieve confidentiality without using encryption when sending data over an insecure channel; it was conceived by Ron Rivest. It can be viewed as a form of steganography. ...more on Wikipedia about "Chaffing and winnowing"
In computing, the Challenge-Handshake Authentication Protocol (CHAP) is an authentication protocol used to log on a user to an Internet access provider. ...more on Wikipedia about "Challenge-handshake authentication protocol"
In computer security, challenge-response authentication is a family of protocols in which one party presents a question ("challenge") and another party must provide a valid answer ("response") to be authenticated. ...more on Wikipedia about "Challenge-response authentication"
Code access security, in the Microsoft .NET framework, is Microsoft's solution to prevent untrusted code from performing privileged actions. When the CLR loads an assembly it will obtain evidence for the assembly and use this to identify the code group that the assembly belongs to. A code group contains a permission set (one or more permissions). Code that performs a privileged action will perform a code access demand which will cause the CLR to walk up the call stack and examine the permission set granted to the assembly of each method in the call stack. If one of these assemblies is not granted the demanded permission then a security exception is thrown and execution stops. ...more on Wikipedia about "Code access security"
Conch is an implementation of the secure shell (SSH) protocol written in the Python programming language. SSH is a protocol designed to allow remote access to shells and commands. Conch implements the server side of this protocol. ...more on Wikipedia about "Conch (SSH)"
The Cryptographic Message Syntax (CMS) is the IETF's standard for cryptographic protected messages. It can be used to digitally sign, digest, authenticate or encrypt any form of digital data. ...more on Wikipedia about "Cryptographic Message Syntax"
A security protocol (or cryptographic protocol) is an abstract or concrete protocol that performs a security-related function and applies cryptographic methods. ...more on Wikipedia about "Cryptographic protocol"
The Datagram Transport Layer Security (DTLS) protocol provides communications privacy for datagram protocols. The protocol allows client/server applications to communicate in a way that is designed to prevent eavesdropping, tampering, or message forgery. The DTLS protocol is based on the TLS protocol and provides equivalent security guarantees. Datagram semantics of the underlying transport are preserved by the DTLS protocol. ...more on Wikipedia about "Datagram Transport Layer Security"
Delegated Path Discovery (DPD) is a method for querying a trusted server for information about a public key certificate. ...more on Wikipedia about "Delegated Path Discovery"
Delegated Path Validation (DPV) is a method for offloading to a trusted server the work involved in validating a public key certificate. ...more on Wikipedia about "Delegated Path Validation"
Diffie-Hellman key exchange is a cryptographic protocol which allows two parties that have no prior knowledge of each other to jointly establish a shared secret key over an insecure communications channel. This key can then be used to encrypt subsequent communications using a symmetric key cipher. ...more on Wikipedia about "Diffie-Hellman key exchange"
The Diffie-Hellman problem (DHP) is an open problem in number theory developed by Whitfield Diffie and Martin Hellman with implications for modern cryptography. If proven, it would prove the level of security for certain types of key exchange, notably Diffie-Hellman key exchange and ElGamal encryption; if disproven, these forms of key exchange would become insecure as one could break. While it is believed to be true, there is no proof for the Diffie-Hellman problems currently available. Informally, there are two main branches of open problems: the first states that no program can quickly compute give , and , the second is a stronger assertion and states that no program can quickly distinguish between and (r is a random number). ...more on Wikipedia about "Diffie-Hellman problem"
DigiCipher 2, or simply DCII, is a digital signal compression standard used on many communications satellite television and audio signals. The DCII standard was originally developed in 1997 by General Instrument, which is now the broadband division of Motorola. ...more on Wikipedia about "DigiCipher 2"
The dining cryptographers protocol is a method of anonymous communication. It offers untraceability of both the sender and the recipient. ...more on Wikipedia about "Dining cryptographers protocol"
Extensible Authentication Protocol Method for UMTS Authentication and Key Agreement, or EAP-AKA, ...more on Wikipedia about "EAP-AKA"
Extensible Authentication Protocol Method for GSM Subscriber Identity, or EAP-SIM, ...more on Wikipedia about "EAP-SIM"
Electronic money (also known as digital money, electronic currency, digital currency or internet money) refers to money which is only exchanged electronically. Typically, this involves the use of computer networks, the internet and digital stored value systems. Electronic Funds Transfer (EFT) and direct deposit are examples of electronic money. It is also a collective term for financial cryptography and technologies enabling it. ...more on Wikipedia about "Electronic money"
Encrypted Key Exchange (also known as EKE) is a family of password-authenticated key agreement methods described by Bellovin and Merritt in (1). Although several of the forms of EKE in this paper were later found to be flawed, the surviving, refined, and enhanced forms of EKE effectively make this the first method to amplify a shared password into a shared key, where the shared may subsequently be used to provide a zero-knowledge password proof or other functions. ...more on Wikipedia about "Encrypted key exchange"
Extensible Authentication Protocol, or EAP (pronounced "eep"), is a universal authentication mechanism, frequently used in wireless networks and Point-to-Point connections. Although the EAP protocol is not limited to wireless LAN networks and can be used for wired LAN authentication, it is most often used in wireless LAN networks. Recently, the WPA and WPA2 standard has officially adopted five EAP types as its official authentication mechanisms. ...more on Wikipedia about "Extensible Authentication Protocol"
In the context of computer networking, FTP over SSH refers to the practice of tunneling a normal FTP session over an SSH connection. ...more on Wikipedia about "FTP over SSH"
This article is licensed under the GNU Free Documentation License.
It uses material from the Wikipedia . Direct links to the original articles are in the text.
If you use exact copy or modified of this article you should preserve above paragraph and put also : It uses material from
the Shortopedia article about "Cryptographic protocols".
| MAIN PAGE | MAIN INDEX | CONTACT US |