Plaintext-Checkable Encryption

DOI10.1007/978-3-642-27954-6_21zbMath1292.94043OpenAlexW1506964068MaRDI QIDQ2890016

Georg Fuchsbauer, Fabien Laguillaumie, Sébastien Canard, Aline Gouget

Publication date: 8 June 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-27954-6_21

zbMATH Keywords

unlinkabilitydeterministic/probabilistic encryptiongroup signature with VLR and backward unlinkability

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Witness authenticating NIZKs and applications ⋮ Generic plaintext equality and inequality proofs ⋮ Plaintext checkable encryption with designated checker ⋮ A generic scheme of plaintext-checkable database encryption

Cites Work

• Unnamed Item
• Private searching on streaming data
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Decryptable Searchable Encryption
• Structure-Preserving Signatures and Commitments to Group Elements
• Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
• Deterministic and Efficiently Searchable Encryption
• Group Signatures with Verifier-Local Revocation and Backward Unlinkability in the Standard Model
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Probabilistic Public Key Encryption with Equality Test
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Fully Anonymous Group Signatures Without Random Oracles
• Verifier-Local Revocation Group Signature Schemes with Backward Unlinkability from Bilinear Maps
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Group Signatures: Better Efficiency and New Theoretical Aspects
• Shorter Verifier-Local Revocation Group Signatures from Bilinear Maps
• Topics in Cryptology – CT-RSA 2005
• Theory of Cryptography

This page was built for publication: Plaintext-Checkable Encryption