Aug 7, 2017 · In this work, we give a new approach for constructing amortized zero-knowledge proofs of knowledge of short solutions over polynomial rings.
This work gives a new approach for constructing amortized zero-knowledge proofs of knowledge of short solutions over polynomial rings that has ...
Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings (Baum & Lyubashevsky - ePrint 2017). Amortization with Fewer Equations for ...
Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings · Efficient Commitments and Zero-Knowledge Protocols from Ring-SIS with ...
Baum, C., Lyubashevsky, V.: Simple amortized proofs of shortness for linear relations over polynomial rings. IACR Cryptology ePrint Archive, 2017:759 (2017).
Efficient Protocols for Oblivious Linear Function Evaluation from Ring ... Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings, with ...
This PhD thesis is about practical lattice-based zero-knowledge proof systems. We construct protocols based on computational lattice assumptions that allow ...
Nov 2, 2020 · Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings. IACR Cryptology ePrint Archive, Vol. 2017 (2017), 759. http ...
... proving short norms work over all (interesting) polynomial rings, but ... Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings.
Baum, C., Lyubashevsky, V.: Simple amortized proofs of shortness for linear relations over polynomial rings. IACR Cryptology ePrint Archive 2017, 759 (2017) ...