Code-Based Zero Knowledge PRF Arguments

DOI10.1007/978-3-030-30215-3_9MaRDI QIDQ6488969zbMATH OpenFDO

Authors Carlo Brunetta, Bei Liang, Aikaterini Mitrokotsa

Publication date 14 March 2024

Full work available at URL https://doi.org/10.1007/978-3-030-30215-3_9

Mathematics Subject Classification ID

Cryptography (94A60) Theory of error-correcting codes and error-detecting codes (94Bxx)

Recommendations

• Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
• New code-based privacy-preserving cryptographic constructions
• Pseudorandom functions and lattices
• Zero-knowledge proofs for committed symmetric Boolean functions
• A new identification scheme based on syndrome decoding

Cites work

• scientific article; zbMATH DE number 3133919 (Why is no real title available?)
• scientific article; zbMATH DE number 4112524 (Why is no real title available?)
• scientific article; zbMATH DE number 1088909 (Why is no real title available?)
• A new paradigm for public key identification
• A provably secure group signature scheme from code-based assumptions
• An efficient pseudo-random generator provably as secure as syndrome decoding
• Improving the performance of the SYND stream cipher
• On the inherent intractability of certain coding problems (Corresp.)
• Progress in Cryptology – Mycrypt 2005
• Pseudorandom functions and lattices
• Pseudorandom functions in almost constant depth from low-noise LPN
• Zero-knowledge arguments for lattice-based PRFs and applications to E-cash

This page was built for publication: Code-Based Zero Knowledge PRF Arguments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488969)