January 01, 2016 conference-paper Open access Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting Lecture notes in computer science DOI: 10.1007/978-3-662-49896-5_12 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 12 stored of 325 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 The Fiat—Shamir Transformation of $$(\varGamma _1,\dots ,\varGamma _\mu )$$-Special-Sound Interactive Proofs 2026 Journal of Cryptology article Computer Science Cryptography and Data Security Open access 0 citations Communication-Efficient Multi-Party Computation for RMS Programs 2024 IACR Communications in Cryptology article Computer Science Cryptography and Data Security Open access 0 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 Generalized Special-Sound Interactive Proofs and Their Knowledge Soundness 2023 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access 8 citations Fiat-Shamir Transformation of Multi-round Interactive Proofs 2022 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access 56 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 Vector Commitments over Rings and Compressed $$\varSigma $$-Protocols 2022 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access 11 citations 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 Compressing Proofs of k-Out-Of-n Partial Knowledge 2021 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access 42 citations Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures 2021 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access 24 citations Compressed Sigma-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures 2021 TNO Repository conference-paper Computer Science Cryptography and Data Security 0 citations Compressed $$\varSigma $$-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics 2020 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access 73 citations 12 results References 0