ParaDiSE: efficient threshold authenticated encryption in fully malicious model
From MaRDI portal
Recommendations
- Adaptively secure threshold symmetric-key encryption
- A new threshold authenticated encryption scheme using labor-division signature
- Threshold Public-Key Encryption with Adaptive Security and Short Ciphertexts
- Adaptively secure non-interactive threshold cryptosystems
- Adaptively secure non-interactive threshold cryptosystems
Cites work
- A Provable-Security Treatment of the Key-Wrap Problem
- Adaptively secure threshold symmetric-key encryption
- Advances in Cryptology - CRYPTO 2003
- All-or-nothing encryption and the package transform
- An algebraic framework for Diffie-Hellman assumptions
- Ciphers for MPC and FHE
- Efficient Construction of (Distributed) Verifiable Random Functions
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Fast Software Encryption
- How to securely release unverified plaintext in authenticated encryption
- scientific article; zbMATH DE number 1583804 (Why is no real title available?)
- scientific article; zbMATH DE number 1722684 (Why is no real title available?)
- scientific article; zbMATH DE number 1304081 (Why is no real title available?)
- scientific article; zbMATH DE number 1030991 (Why is no real title available?)
- scientific article; zbMATH DE number 1088907 (Why is no real title available?)
- scientific article; zbMATH DE number 1418314 (Why is no real title available?)
- Indifferentiable authenticated encryption
- Key homomorphic PRFs and their applications
- MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
- On-line ciphers and the Hash-CBC constructions
- ParaDiSE: efficient threshold authenticated encryption in fully malicious model
- Practical revocation and key rotation
- Progress in Cryptology - INDOCRYPT 2004
- Robust authenticated-encryption AEZ and the problem that it solves
- Selected Areas in Cryptography
- The multi-user security of authenticated encryption: AES-GCM in TLS 1.3
- Theory of Cryptography
- Theory of Cryptography
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- TOPPSS: cost-minimal password-protected secret sharing based on threshold OPRF
Cited in
(3)
This page was built for publication: ParaDiSE: efficient threshold authenticated encryption in fully malicious model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169456)