Plaintext-checkable encryption
From MaRDI portal
Recommendations
Cites work
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Decryptable Searchable Encryption
- Deterministic and Efficiently Searchable Encryption
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Fully Anonymous Group Signatures Without Random Oracles
- Group Signatures with Verifier-Local Revocation and Backward Unlinkability in the Standard Model
- Group Signatures: Better Efficiency and New Theoretical Aspects
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- scientific article; zbMATH DE number 1759783 (Why is no real title available?)
- Private searching on streaming data
- Probabilistic public key encryption with equality test
- Shorter Verifier-Local Revocation Group Signatures from Bilinear Maps
- Structure-preserving signatures and commitments to group elements
- Theory of Cryptography
- Topics in Cryptology – CT-RSA 2005
- Verifier-Local Revocation Group Signature Schemes with Backward Unlinkability from Bilinear Maps
Cited in
(8)- Privacy-preserving plaintext-equality of low-entropy inputs
- Plaintext checkable encryption with designated checker
- Witness authenticating NIZKs and applications
- Generic plaintext equality and inequality proofs
- Plaintext-checkable encryption with unlink-CCA security in the standard model
- Plaintext-verifiably-checkable encryption
- A conceptually simple and generic construction of plaintext checkable encryption in the standard model
- A generic scheme of plaintext-checkable database encryption
This page was built for publication: Plaintext-checkable encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890016)