A conceptually simple and generic construction of plaintext checkable encryption in the standard model
From MaRDI portal
Publication:6544472
DOI10.1007/s10623-024-01363-4zbMATH Open1547.9434MaRDI QIDQ6544472
Publication date: 27 May 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- A generic scheme of plaintext-checkable database encryption
- A proof of security of Yao's protocol for two-party computation
- Registration-based encryption: removing private-key generator from IBE
- Identity-based encryption from the Diffie-Hellman assumption
- New constructions of identity-based and key-dependent message secure encryption schemes
- Plaintext checkable encryption with designated checker
- Plaintext-checkable encryption with unlink-CCA security in the standard model
- Plaintext-verifiably-checkable encryption
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Plaintext-Checkable Encryption
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Theory of Cryptography
This page was built for publication: A conceptually simple and generic construction of plaintext checkable encryption in the standard model