Ciphertext indistinguishabilityCiphertext indistinguishability is a property of many encryption schemes. Intuitively, if a cryptosystem possesses the property of indistinguishability, an adversary will be unable to distinguish pairs of ciphertext based on the message that they encrypt.
Symmetric-key algorithmSymmetric-key algorithms are algorithms for cryptography that use the same cryptographic keys for both the encryption of plaintext and the decryption of ciphertext. The keys may be identical, or there may be a simple transformation to go between the two keys. The keys, in practice, represent a shared secret between two or more parties that can be used to maintain a private information link.
Silvio MicaliSilvio Micali (born October 13, 1954) is an Italian computer scientist, professor at the Massachusetts Institute of Technology and the founder of Algorand, a proof-of-stake blockchain cryptocurrency protocol. Micali's research at the MIT Computer Science and Artificial Intelligence Laboratory centers on cryptography and information security. In 2012, he and Shafi Goldwasser received the Turing Award for their work on cryptography.
CiphertextIn cryptography, ciphertext or cyphertext is the result of encryption performed on plaintext using an algorithm, called a cipher. Ciphertext is also known as encrypted or encoded information because it contains a form of the original plaintext that is unreadable by a human or computer without the proper cipher to decrypt it. This process prevents the loss of sensitive information via hacking.Chosen-ciphertext attackA chosen-ciphertext attack (CCA) is an attack model for cryptanalysis in which the cryptanalyst can gather information by obtaining the decryptions of chosen ciphertexts. From those pieces of information, the adversary can attempt to recover the secret key used for decryption. For formal definitions of security against chosen-ciphertext attacks, see, for example, Michael Luby and Mihir Bellare et al.
Shafi GoldwasserShafrira Goldwasser (Hebrew: שפרירה גולדווסר; born November 14, 1959) is an Israeli-American computer scientist. She is the RSA Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology, a professor of mathematical sciences at the Weizmann Institute of Science, the former director of the Simons Institute for the Theory of Computing, and co-founder and chief scientist of Duality Technologies.
Information-theoretic securityA cryptosystem is considered to have information-theoretic security (also called unconditional security) if the system is secure against adversaries with unlimited computing resources and time. In contrast, a system which depends on the computational cost of cryptanalysis to be secure (and thus can be broken by an attack with unlimited computation) is called computationally secure or conditionally secure.
CryptographyCryptography, or cryptology, 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.CryptosystemIn cryptography, a cryptosystem is a suite of cryptographic algorithms needed to implement a particular security service, such as confidentiality (encryption). Typically, a cryptosystem consists of three algorithms: one for key generation, one for encryption, and one for decryption. The term cipher (sometimes cypher) is often used to refer to a pair of algorithms, one for encryption and one for decryption.PlaintextIn cryptography, plaintext usually means unencrypted information pending input into cryptographic algorithms, usually encryption algorithms. This usually refers to data that is transmitted or stored unencrypted.
PP (complexity)In complexity theory, PP, or PPT is the class of decision problems solvable by a probabilistic Turing machine in polynomial time with an error probability of less than 1/2 for all instances. The abbreviation PP refers to probabilistic polynomial time. The complexity class was defined by Gill in 1977.
Claude ShannonAmerican mathematician (1916–2001)Claude Elwood Shannon (April 30, 1916 – February 24, 2001) was an American polymath who was a mathematician, electrical engineer, computer scientist, cryptographer, and inventor known as the "father of information theory", and the man who laid the foundations of the Information Age.*As an Amazon Associate I earn from qualifying purchases.