Explore a conference talk on zero-knowledge arguments for lattice-based pseudorandom functions (PRFs) and their applications to electronic cash systems. Delve into the research presented by Benoît Libert, San Ling, Khoa Nguyen, and Huaxiong Wang at Asiacrypt 2017. Gain insights into advanced cryptographic techniques that combine lattice-based cryptography with zero-knowledge proofs, and understand their potential impact on secure and privacy-preserving digital payment systems. Learn about the latest developments in this cutting-edge area of cryptography and its practical implications for the future of electronic transactions.
Zero Knowledge Arguments for Lattice-Based PRFs and Applications to E-Cash
Overview
Syllabus
Zero Knowledge Arguments for Lattice-Based PRFs and applications to e-cash
Taught by
TheIACR
Related Courses
-
Lattice Based Zero Knowledge Arguments for Integer Relations
-
Zero-Knowledge Arguments for Lattice-Based Accumulators - Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
-
Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption
-
Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
-
Adaptive Oblivious Transfer with Access Control from Lattice Assumptions
-
Sub Linear Lattice Based Zero Knowledge Arguments for Arithmetic Circuits
