Constant ciphertext-rate non-committing encryption from standard assumptions
From MaRDI portal
Recommendations
- Optimal-rate non-committing encryption
- Non-committing encryption with constant ciphertext expansion from standard assumptions
- Non-committing encryption with quasi-optimal ciphertext-rate based on the DDH problem
- New and improved constructions for partially equivocable public key encryption
- scientific article; zbMATH DE number 1759794
Cited in
(17)- Error-free, Multi-bit Non-committing Encryption with Constant Round Complexity
- Improved non-committing encryption with applications to adaptively secure protocols
- Two-round adaptively secure MPC from isogenies, LPN, or CDH
- A framework for statistically sender private OT with optimal rate
- Algebraic restriction codes and their applications
- New Constructions of Constant Size Ciphertext HIBE Without Random Oracle
- Cryptography with constant input locality
- Batch-OT with optimal rate
- Rate-1 fully local somewhere extractable hashing from DDH
- Two-round maliciously-secure oblivious transfer with optimal rate
- Adaptive and composable non-committing encryptions
- Non-committing encryption with quasi-optimal ciphertext-rate based on the DDH problem
- Amortizing rate-1 OT and applications to PIR and PSI
- 10-party sublinear secure computation from standard assumptions
- Non-committing encryption with constant ciphertext expansion from standard assumptions
- Optimal-rate non-committing encryption
- New and improved constructions for partially equivocable public key encryption
This page was built for publication: Constant ciphertext-rate non-committing encryption from standard assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2055714)
