New code-based privacy-preserving cryptographic constructions
From MaRDI portal
Recommendations
Cited in
(14)- 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
- Post-quantum secure fully-dynamic logarithmic-size deniable group signature in code-based setting
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Zero-knowledge range arguments for signed fractional numbers from lattices
- Fully dynamic attribute-based signatures for circuits from codes
- Non-interactive composition of sigma-protocols via Share-then-Hash
- Efficient code-based fully dynamic group signature scheme
- Short code-based one-out-of-many proofs and applications
- Code-Based Zero Knowledge PRF Arguments
- Acyclicity programming for sigma-protocols
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
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)