|
Security Protocols Open Repository
SPORE, the Security Protocols Open Repository, is an online library of security protocols with comments and links to papers. Each protocol is downloadable in a variety of formats, including rules for use with automatic protocol verification tools. All protocols are described using BAN logic or the style used by Clark and Jacob, and their goals. The database includes details on formal proofs or known attacks, with references to comments, analysis & papers. A large number of protocols are listed, including many which have been shown to be insecure. It is a continuation of the seminal work by John Clark and Jeremy Jacob. , the original 1997 paper by |
Security Protocol
A security protocol (cryptographic protocol or encryption protocol) is an abstract or concrete protocol that performs a security-related function and applies cryptographic methods, often as sequences of cryptographic primitives. A protocol describes how the algorithms should be used and includes details about data structures and representations, at which point it can be used to implement multiple, interoperable versions of a program. Cryptographic protocols are widely used for secure application-level data transport. A cryptographic protocol usually incorporates at least some of these aspects: * Key agreement or establishment * Entity authentication * Symmetric encryption and message authentication material construction * Secured application-level data transport * Non-repudiation methods * Secret sharing methods * Secure multi-party computation For example, Transport Layer Security (TLS) is a cryptographic protocol that is used to secure web (HTTPS) connections. It has an e ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
John Clark (Computer Scientist)
John Clark may refer to: Entertainment *John Clark or Signor Brocolini (1841–1906), Irish-born American operatic singer and actor * John Clark (actor) (born 1932), English actor and theatre director * John Clark (American actor) (1933–2011), mainly in Spaghetti Westerns * John Clark (musician) (born 1944), American jazz horn player and composer *John Clark (born 1978), Scottish indie/electronic musician from the band Bis who is also known as John Disco * John Drury Clark (1907–1988), American author, chemist and rocket scientist *John Heaviside Clark (c. 1771–1836), Scottish engraver and painter Military * John Clark (spy), American spy during the American Revolutionary War *John George Walters Clark (1892–1948), British army officer *John W. Clark (Medal of Honor) (1830–1898), American soldier in the American Civil War Politics American * John Clark (Delaware governor) (1761–1821), American governor and farmer of Delaware * John Clark (Georgia governor) (1766–1 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jeremy Jacob (Computer Scientist)
Jeremy may refer to: * Jeremy (given name), a given name * Jérémy, a French given name * ''Jeremy'' (film), a 1973 film * "Jeremy" (song), a song by Pearl Jam * Jeremy (snail), a left-coiled garden snail that died in 2017 * ''Jeremy'', a 1919 novel by Hugh Walpole See also * * * Jeremiah (other) * Jeremie (other) * Jerome (other) Jerome (c.347–420) was a priest, confessor, theologian and historian from Dalmatia. Jerome may also refer to: People Given name * Jerome (given name), a masculine name of Greek origin, with a list of people so named * Saint Jerome (disambigu ... * Jeromy (other) {{disambiguation ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cryptographic Nonce
In cryptography, a nonce is an arbitrary number that can be used just once in a cryptographic communication. It is often a random or pseudo-random number issued in an authentication protocol to ensure that old communications cannot be reused in replay attacks. They can also be useful as initialization vectors and in cryptographic hash functions. Definition A nonce is an arbitrary number used only once in a cryptographic communication, in the spirit of a nonce word. They are often random or pseudo-random numbers. Many nonces also include a timestamp to ensure exact timeliness, though this requires clock synchronisation between organisations. The addition of a client nonce ("cnonce") helps to improve the security in some ways as implemented in digest access authentication. To ensure that a nonce is used only once, it should be time-variant (including a suitably fine-grained timestamp in its value), or generated with enough random bits to ensure a insignificantly low cha ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cryptography
Cryptography, or cryptology (from grc, , translit=kryptós "hidden, secret"; and ''graphein'', "to write", or ''-logia'', "study", respectively), is the practice and study of techniques for secure communication in the presence of adversarial behavior. More generally, cryptography is about constructing and analyzing protocols that prevent third parties or the public from reading private messages. Modern cryptography exists at the intersection of the disciplines of mathematics, computer science, information security, electrical engineering, digital signal processing, physics, and others. Core concepts related to information security (data confidentiality, data integrity, authentication, and non-repudiation) are also central to cryptography. Practical applications of cryptography include electronic commerce, chip-based payment cards, digital currencies, computer passwords, and military communications. Cryptography prior to the modern age was effectively synony ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Books On Cryptography
Books on cryptography have been published sporadically and with highly variable quality for a long time. This is despite the tempting, though superficial, paradox that secrecy is of the essence in sending confidential messages — see Kerckhoffs' principle. In contrast, the revolutions in cryptography and secure communications since the 1970s are well covered in the available literature. Early history An early example of a book about cryptography was a Roman work, now lost and known only by references. Many early cryptographic works were esoteric, mystical, and/or reputation-promoting; cryptography being mysterious, there was much opportunity for such things. At least one work by Trithemius was banned by the Catholic Church and put on the Index Librorum Prohibitorum as being about black magic or witchcraft. Many writers claimed to have invented unbreakable ciphers. None were, though it sometimes took a long while to establish this. In the 19th century, the general standard imp ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
List Of Important Publications In Computer Science
This is a list of important publications in computer science, organized by field. Some reasons why a particular publication might be regarded as important: *Topic creator – A publication that created a new topic *Breakthrough – A publication that changed scientific knowledge significantly *Influence – A publication which has significantly influenced the world or has had a massive impact on the teaching of computer science. Artificial intelligence ''Computing Machinery and Intelligence'' * Alan Turing * Mind, 59:433–460, 1950. Online copy Description: This paper discusses the various arguments on why a machine can not be intelligent and asserts that none of those arguments are convincing. The paper also suggested the Turing test, which it calls "The Imitation Game" as according to Turing it is pointless to ask whether or not a machine can ''think'' intelligently, and checking if it can ''act'' intelligently is sufficient. ''A Proposal for the Dartmouth S ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
List Of Open Problems In Computer Science
This article is a list of notable unsolved problems in computer science. A problem in computer science is considered unsolved when no solution is known, or when experts in the field disagree about proposed solutions. Computational complexity * P versus NP problem * What is the relationship between BQP and NP? * NC = P problem * NP = co-NP problem * P = BPP problem * P = PSPACE problem * L = NL problem * PH = PSPACE problem * L = P problem * L = RL problem * Unique games conjecture * Is the exponential time hypothesis true? ** Is the strong exponential time hypothesis (SETH) true? * Do one-way functions exist? ** Is public-key cryptography possible? * Log-rank conjecture Polynomial versus nondeterministic-polynomial time for specific algorithmic problems * Can integer factorization be done in polynomial time on a classical (non-quantum) computer? * Can the discrete logarithm be computed in polynomial time on a classical (non-quantum) computer? * Can the shortest vect ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Topics In Cryptography
The following outline is provided as an overview of and topical guide to cryptography: Cryptography (or cryptology) – practice and study of hiding information. Modern cryptography intersects the disciplines of mathematics, computer science, and engineering. Applications of cryptography include ATM cards, computer passwords, and electronic commerce. Essence of cryptography * Cryptographer * Encryption/decryption * Cryptographic key * Cipher * Ciphertext * Plaintext * Code * Tabula recta * Alice and Bob Uses of cryptographic techniques * Commitment schemes * Secure multiparty computation * Electronic voting * Authentication * Digital signatures * Crypto systems * Dining cryptographers problem * Anonymous remailer * Pseudonymity * Onion routing * Digital currency * Secret sharing * Indistinguishability obfuscation Branches of cryptography * Multivariate cryptography * Post-quantum cryptography * Quantum cryptography * Steganography * Visual cryptograph ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Public-key Cryptography
Public-key cryptography, or asymmetric cryptography, is the field of cryptographic systems that use pairs of related keys. Each key pair consists of a public key and a corresponding private key. Key pairs are generated with cryptographic algorithms based on mathematical problems termed one-way functions. Security of public-key cryptography depends on keeping the private key secret; the public key can be openly distributed without compromising security. In a public-key encryption system, anyone with a public key can encrypt a message, yielding a ciphertext, but only those who know the corresponding private key can decrypt the ciphertext to obtain the original message. For example, a journalist can publish the public key of an encryption key pair on a web site so that sources can send secret messages to the news organization in ciphertext. Only the journalist who knows the corresponding private key can decrypt the ciphertexts to obtain the sources' messages—an eaves ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
List Of Cryptographers
This is a list of cryptographers. Cryptography is the practice and study of techniques for secure communication in the presence of third parties called adversaries. Pre twentieth century * Al-Khalil ibn Ahmad al-Farahidi: wrote a (now lost) book on cryptography titled the "''Book of Cryptographic Messages''". * Al-Kindi, 9th century Arabic polymath and originator of frequency analysis. * Athanasius Kircher, attempts to decipher crypted messages * Augustus the Younger, Duke of Brunswick-Lüneburg, wrote a standard book on cryptography * Ibn Wahshiyya: published several cipher alphabets that were used to encrypt magic formulas. * John Dee, wrote an occult book, which in fact was a cover for crypted text * Ibn 'Adlan: 13th-century cryptographer who made important contributions on the sample size of the frequency analysis. * Duke of Mantua Francesco I Gonzaga is the one who used the earliest example of homophonic Substitution cipher in early 1400s. * Ibn al-Durayhim: gave detailed de ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
