July 01, 2024 article Open access Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency Journal of Cryptology DOI: 10.1007/s00145-024-09511-8 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 0 stored of 14 References 5 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access A Compressed $$\varSigma $$-Protocol Theory for Lattices 2021 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access 75 citations The Measure-and-Reprogram Technique 2.0: Multi-round Fiat-Shamir and More 2020 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access 61 citations Practical Product Proofs for Lattice Commitments 2020 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access 60 citations Parallel Repetition of $$(k_1,\dots ,k_{\mu })$$-Special-Sound Multi-round Interactive Proofs 2022 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access 25 citations Fiat–Shamir Transformation of Multi-Round Interactive Proofs (Extended Version) 2023 Journal of Cryptology article Computer Science Cryptography and Data Security Open access 15 citations 5 results