ParaDiSE: efficient threshold authenticated encryption in fully malicious model
From MaRDI portal
Publication:6169456
DOI10.1007/978-3-031-22912-1_2zbMath1519.94025OpenAlexW4313335095MaRDI QIDQ6169456
No author found.
Publication date: 14 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22912-1_2
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Indifferentiable authenticated encryption
- On-line ciphers and the Hash-CBC constructions
- Adaptively secure threshold symmetric-key encryption
- Practical revocation and key rotation
- The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3
- Key Homomorphic PRFs and Their Applications
- An Algebraic Framework for Diffie-Hellman Assumptions
- How to Securely Release Unverified Plaintext in Authenticated Encryption
- Robust Authenticated-Encryption AEZ and the Problem That It Solves
- Ciphers for MPC and FHE
- MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- A Provable-Security Treatment of the Key-Wrap Problem
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Efficient Construction of (Distributed) Verifiable Random Functions
- All-or-nothing encryption and the package transform
- Advances in Cryptology - CRYPTO 2003
- Theory of Cryptography
- Progress in Cryptology - INDOCRYPT 2004
- Fast Software Encryption
- Selected Areas in Cryptography
- Theory of Cryptography
- ParaDiSE: efficient threshold authenticated encryption in fully malicious model
This page was built for publication: ParaDiSE: efficient threshold authenticated encryption in fully malicious model