A tag is a keyword or label that categorizes your question with other, similar questions. Using the right tags makes it easier for others to find and answer your question.

Type to find tags:
× 5
the problem of determining which numbers from a given collection of numbers have been added together to yield a specific sum: used in cryptography to encipher (and sometimes decipher) mess…
× 5
Needham–Schroeder refers to both, a symmetric key or a public key authentication protocol.
× 5
a Feistel cipher where in each round the nonlinear function used is assumed to be chosen uniformly at random from the set of all such functions. These ciphers are mainly of th…
× 5
× 5 × 5
Public-Key Cryptography Standard, number 8, describes the Private-Key Information Syntax Standard which is used to carry (encrypted or unencrypted) private certificate keypairs. See [RFC 5208](http://…
× 5
A PIR (Private Information Retrieval) protocol allows a user to retrieve an item from a server in possession of a database without revealing which item is retrieved.
× 5
a variant of ID-based cryptography intended to prevent the key escrow problem. Only a partial private key is generated by the key generation center (KGC) and the other …
× 5
a function $f$ from a set $X$ to a set $Y$ with the property that, for every $y$ in $Y$, there is exactly one $x$ in $X$ such that $f(x) = y$. It follows from …
× 5
Questions related to the teaching and learning of cryptography.
× 5
short-lived, like (for example) an ephemeral key, which is a key that only exists within the lifetime of a communication session.
× 4
× 4
A homomorphic signature scheme (also malleable signature scheme) is a digital signature scheme that allows computations on signed data (without access to the secret signing key) while preserving the…
× 4
a family of binary, linear error-correcting codes that are used to detect and correct data transmission errors. Hamming codes are able detect up to two simultaneous bit errors and ca…
× 4
a cryptographic hash function. It was designed for the SHA-3 competition where it became a finalist, but wasn't chosen as SHA-3.
× 4
an SQL-Aware encrypted database system from MIT
× 4
Plausible deniability may refer $1)$ to deniable encryption schemes allowing to decrypt a ciphertext for a message $m$ to some distinct message $m'$ or $2)$ to a feature provided by deniable file syst…
× 4
Remote data checking protocols allow a client that has stored data at an untrusted server to efficiently verify that the server possesses the original data without retrieving it.
× 4
to "scramble" or mix the internal state of a hash (or cipher) function. The input to the function is the current internal state and the output of the function bec…
× 4
RFC 1320 — the MD4 message-digest algorithm — is a cryptographic hash function with a digest length is 128 bits, developed by Ronald Rivest in 1990.
× 4
× 4 × 4
× 4
Secure/Multipurpose Internet Mail Extensions, or short S-MIME, is a standard for public key encryption and signing of MIME data.
× 4
the average amount of ciphertext a computationally unlimited attacker needs to obtain in order to uniquely determine the correct decryption.
× 4
The three-pass protocol uses commutative encryption to let two people communicate privately without having to exchange keys in advance.
× 4 × 3
a Crypto SDK was developed by Microsoft to support experimentation with the foundational features of the U-Prove technology. It is made available under the Apache 2.0 open-source license, w…
× 3
× 3
the process of intercepting and examining messages in order to deduce information from patterns in communication. Within cryptography this definition is restricted to deduce inform…
× 3
A famous program that was the de-facto standard for open-source disk encryption for many years. It was discontinued on 28 may 2014. TrueCrypt has undergone some security audits which haven't found sev…
× 3
A family of lightweight symmetric block-ciphers designed for good performance in constrained software devices with block sizes ranging from 32 to 128 bits and key sizes ranging from 64 to 256 bits.
× 3
a block cipher by David Wheeler and Roger Needham of the Cambridge Computer Laboratory; notable for its simplicity of description and implementation.
× 3
a key derivation function ([tag:kdf]) that uses a key in the computation.
× 3
An attack on TLS and related protocols as of may 2015. This attack uses pre-computations to attack short prime diffie hellmann key exchange, primes with up to 1024 bits length are considered broken. I…
× 3
Let $\Omega$ be a set of entities. An *access structure* $\mathcal{A}$ is a collection of nonempty subsets of the power set $P(\mathcal{A})$. This structure is called *monotone*, if $A\in\mathcal{A}$ …