SPHF-friendly non-interactive commitments
From MaRDI portal
Recommendations
Cited in
(18)- Fine-grained cryptography revisited
- Beating the birthday paradox in dining cryptographer networks
- Private set intersection: new generic constructions and feasibility results
- All-but-many encryption
- Smooth NIZK arguments
- Implicit zero-knowledge arguments and applications to the malicious setting
- New techniques for SPHFs and efficient one-round PAKE protocols
- One-round strong oblivious signature-based envelope
- Structure-preserving smooth projective hashing
- Efficient and round-optimal oblivious transfer and commitment with adaptive security
- Removing erasures with explainable hash proof systems
- Almost optimal oblivious transfer from QA-NIZK
- A framework for witness encryption from linearly verifiable SNARKs and applications
- Universal composable password authenticated key exchange for the post-quantum world
- \textsc{Leap}: a fast, lattice-based OPRF with application to private set intersection
- A new general framework for secure public key encryption with keyword search
- Generic construction of UC-secure oblivious transfer
- Adaptive oblivious transfer and generalization
This page was built for publication: SPHF-friendly non-interactive commitments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867220)