Search results
Results from the WOW.Com Content Network
Off-the-Record Messaging, a cryptographic technique providing true deniability for instant messaging. OpenPuff, freeware semi-open-source steganography for MS Windows. StegFS, the current successor to the ideas embodied by the Rubberhose and PhoneBookFS filesystems. Vanish, a research prototype implementation of self-destructing data storage.
In cryptography, the Double Ratchet Algorithm (previously referred to as the Axolotl Ratchet [2] [3]) is a key management algorithm that was developed by Trevor Perrin and Moxie Marlinspike in 2013. It can be used as part of a cryptographic protocol to provide end-to-end encryption for instant messaging .
In cryptography, deniable authentication refers to message authentication between a set of participants where the participants themselves can be confident in the authenticity of the messages, but it cannot be proved to a third party after the event. [1] [2] [3]
The History of Non-Secret Encryption JH Ellis 1987 (28K PDF file) (HTML version) The First Ten Years of Public-Key Cryptography Whitfield Diffie, Proceedings of the IEEE, vol. 76, no. 5, May 1988, pp: 560–577 (1.9MB PDF file) Menezes, Alfred; van Oorschot, Paul; Vanstone, Scott (1997). Handbook of Applied Cryptography Boca Raton, Florida: CRC ...
In cryptography, forward secrecy (FS), also known as perfect forward secrecy (PFS), is a feature of specific key-agreement protocols that gives assurances that session keys will not be compromised even if long-term secrets used in the session key exchange are compromised, limiting damage.
Plausible deniability is the ability of people, typically senior officials in a formal or informal chain of command, to deny knowledge and/or responsibility for actions committed by or on behalf of members of their organizational hierarchy.
Non-interactive zero-knowledge proofs are cryptographic primitives, where information between a prover and a verifier can be authenticated by the prover, without revealing any of the specific information beyond the validity of the statement itself. This makes direct communication between the prover and verifier unnecessary, effectively removing ...
One particular motivating example is the use of commitment schemes in zero-knowledge proofs.Commitments are used in zero-knowledge proofs for two main purposes: first, to allow the prover to participate in "cut and choose" proofs where the verifier will be presented with a choice of what to learn, and the prover will reveal only what corresponds to the verifier's choice.