New code-based privacy-preserving cryptographic constructions
From MaRDI portal
Recommendations
Cited in
(16)- Group encryption: full dynamicity, message filtering and code-based instantiation
- New code-based cryptographic accumulator and fully dynamic group signature
- Zero-knowledge proofs for committed symmetric Boolean functions
- On the privacy of a code-based single-server computational PIR scheme
- Non-interactive composition of sigma-protocols via Share-then-Hash
- Acyclicity programming for sigma-protocols
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
- Zero-knowledge range arguments for signed fractional numbers from lattices
- Efficient code-based fully dynamic group signature scheme
- Code-Based Zero Knowledge PRF Arguments
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Post-quantum secure fully-dynamic logarithmic-size deniable group signature in code-based setting
- Fully dynamic attribute-based signatures for circuits from codes
- Short code-based one-out-of-many proofs and applications
- Code-based zero-knowledge from VOLE-in-the-head and their applications: simpler, faster, and smaller
- Cryptographic accumulators: new definitions, enhanced security, and delegatable proofs
This page was built for publication: New code-based privacy-preserving cryptographic constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176638)