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:
× 3 × 3
A method for anonymous communications over a wide area network such as the Internet.
× 3
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…
× 3
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…
× 3
an encryption paradigm which gives a master secret key owner fine-grained control over access to encrypted data.
× 3
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.
× 2
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://…
× 2
× 2
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.
× 2
The Miyaguchi-Preneel scheme, based on a one-way compression function, was proposed around 1989 by Preneel, and independently by Miyaguchi.Ohta, and Iwata.
× 2
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}$ …
× 2
so unimportant, that it isn't worth considering. For example, if a flaw in a cryptographic algorithm is considered to be negligible, it is insignificant to both the …
× 2
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.
× 2
Key rotation refers to a schedule or process for changing the key material.
× 2
the most important hardware component of a computer system, since it contains the circuitry necessary to interpret and execute instructions.
× 2
× 2
Something of mixed origin. In cryptography, typically a cipher system containing both public key and secret key component ciphers, where the public key system is used only to transport the key for the…
× 2
× 2
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…
× 2
short-lived, like (for example) an ephemeral key, which is a key that only exists within the lifetime of a communication session.
× 2
Questions related to the teaching and learning of cryptography.
× 2
an extension of DES that attempts to foil brute force attacks
× 2
× 2
a technology that allows telephone calls to be made over computer networks like the Internet.
× 2
× 2
Encryption of data represented in XML according to the W3C Specification.
× 2
a 64-bit block cipher developed by the U.S. National Security Agency (NSA).
× 2
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.
SHA-3 Competition (2007-2012) was a competition initiated by NIST as a call for a new cryptographic hash algorithm for standardization purposes.
A family of tweakable symmetric block-cipher algorithms with 256, 512 and 1024 bit block and key sizes.
a VPN tunneling protocol that allows the tunneling of PPP or L2TP traffic over an SSL connection.
the process of breaking a stream of text up into words, phrases, symbols, or other meaningful elements called tokens.
Traitor tracing describes an ability of specific cryptographic schemes that helps trace the source of leaks.