math/paper-notes.bib
paper-notes.bibRaw
1@misc{cryptoeprint:2021/529,
2 author = {Nicolas Gailly and Mary Maller and Anca Nitulescu},
3 title = {SnarkPack: Practical SNARK Aggregation},
4 howpublished = {Cryptology ePrint Archive, Paper 2021/529},
5 year = {2021},
6 note = {\url{https://eprint.iacr.org/2021/529}},
7 url = {https://eprint.iacr.org/2021/529}
8}
9
10@misc{cryptoeprint:2019/099,
11 author = {Mary Maller and Sean Bowe and Markulf Kohlweiss and Sarah Meiklejohn},
12 title = {Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updateable Structured Reference Strings},
13 howpublished = {Cryptology ePrint Archive, Paper 2019/099},
14 year = {2019},
15 note = {\url{https://eprint.iacr.org/2019/099}},
16 url = {https://eprint.iacr.org/2019/099}
17}
18
19@misc{kzg-tmp,
20 author = {A. Kate and G. M. Zaverucha and and I. Goldberg},
21 title = {Constant-size commitments to polynomials and their application},
22 year = {2010},
23 note = {\url{https://www.iacr.org/archive/asiacrypt2010/6477178/6477178.pdf}},
24 url = {https://www.iacr.org/archive/asiacrypt2010/6477178/6477178.pdf}
25}
26
27@misc{bls-sig-eth2,
28 author = {Eth2.0},
29 title = {Eth2.0 book - BLS signatures},
30 year = {2010},
31 note = {\url{https://eth2book.info/altair/part2/building_blocks/signatures}},
32 url = {https://eth2book.info/altair/part2/building_blocks/signatures}
33}
34@misc{cryptoeprint:2019/1021,
35 author = {Sean Bowe and Jack Grigg and Daira Hopwood},
36 title = {Recursive Proof Composition without a Trusted Setup},
37 howpublished = {Cryptology ePrint Archive, Paper 2019/1021},
38 year = {2019},
39 note = {\url{https://eprint.iacr.org/2019/1021}},
40 url = {https://eprint.iacr.org/2019/1021}
41}
42
43@misc{cryptoeprint:2022/621,
44 author = {Arantxa Zapico and Vitalik Buterin and Dmitry Khovratovich and Mary Maller and Anca Nitulescu and Mark Simkin},
45 title = {Caulk: Lookup Arguments in Sublinear Time},
46 howpublished = {Cryptology ePrint Archive, Paper 2022/621},
47 year = {2022},
48 note = {\url{https://eprint.iacr.org/2022/621}},
49 url = {https://eprint.iacr.org/2022/621}
50}
51
52@misc{cryptoeprint:2022/957,
53 author = {Jim Posen and Assimakis A. Kattis},
54 title = {Caulk+: Table-independent lookup arguments},
55 howpublished = {Cryptology ePrint Archive, Paper 2022/957},
56 year = {2022},
57 note = {\url{https://eprint.iacr.org/2022/957}},
58 url = {https://eprint.iacr.org/2022/957}
59}
60
61@misc{fri,
62 author = {Eli Ben-Sasson and Iddo Bentov and Yinon Horesh and Michael Riabzev},
63 title = {Fast Reed-Solomon Interactive Oracle Proofs of Proximity},
64 year = {2018},
65 note = {\url{https://eccc.weizmann.ac.il/report/2017/134/}},
66 url = {https://eccc.weizmann.ac.il/report/2017/134/}
67}
68@misc{cryptoeprint:2022/1216,
69 author = {Ulrich Haböck},
70 title = {A summary on the FRI low degree test},
71 howpublished = {Cryptology ePrint Archive, Paper 2022/1216},
72 year = {2022},
73 note = {\url{https://eprint.iacr.org/2022/1216}},
74 url = {https://eprint.iacr.org/2022/1216}
75}
76@misc{cryptoeprint:2019/1020,
77 author = {Alexander Vlasov and Konstantin Panarin},
78 title = {Transparent Polynomial Commitment Scheme with Polylogarithmic Communication Complexity},
79 howpublished = {Cryptology ePrint Archive, Paper 2019/1020},
80 year = {2019},
81 note = {\url{https://eprint.iacr.org/2019/1020}},
82 url = {https://eprint.iacr.org/2019/1020}
83}
84@misc{cryptoeprint:2024/390,
85 author = {Gal Arnon and Alessandro Chiesa and Giacomo Fenzi and Eylon Yogev},
86 title = {{STIR}: Reed–Solomon Proximity Testing with Fewer Queries},
87 howpublished = {Cryptology {ePrint} Archive, Paper 2024/390},
88 year = {2024},
89 note = {\url{https://eprint.iacr.org/2024/390}},
90 url = {https://eprint.iacr.org/2024/390}
91}
92
93
94@misc{cryptoeprint:2021/370,
95 author = {Abhiram Kothapalli and Srinath Setty and Ioanna Tzialla},
96 title = {Nova: Recursive Zero-Knowledge Arguments from Folding Schemes},
97 howpublished = {Cryptology ePrint Archive, Paper 2021/370},
98 year = {2021},
99 note = {\url{https://eprint.iacr.org/2021/370}},
100 url = {https://eprint.iacr.org/2021/370}
101}
102
103@misc{vincenzoiovino,
104 title = {{Vincenzo Iovino}},
105 note = {\url{https://sites.google.com/site/vincenzoiovinoit/}},
106 url = {https://sites.google.com/site/vincenzoiovinoit/}
107}
108@misc{hectormasipardevol,
109 title = {{Héctor Masip Ardevol}},
110 note = {\url{https://hecmas.github.io}},
111 url = {https://hecmas.github.io}
112}
113@misc{fri-impl,
114 note = {\url{https://github.com/arnaucube/fri-commitment}},
115 url = {https://github.com/arnaucube/fri-commitment}
116}
117
118@misc{cryptoeprint:2019/550,
119 author = {Srinath Setty},
120 title = {Spartan: Efficient and general-purpose zkSNARKs without trusted setup},
121 howpublished = {Cryptology ePrint Archive, Paper 2019/550},
122 year = {2019},
123 note = {\url{https://eprint.iacr.org/2019/550}},
124 url = {https://eprint.iacr.org/2019/550}
125}
126
127@misc{cryptoeprint:2023/552,
128 author = {Srinath Setty and Justin Thaler and Riad Wahby},
129 title = {Customizable constraint systems for succinct arguments},
130 howpublished = {Cryptology ePrint Archive, Paper 2023/552},
131 year = {2023},
132 note = {\url{https://eprint.iacr.org/2023/552}},
133 url = {https://eprint.iacr.org/2023/552}
134}
135@misc{cryptoeprint:2023/573,
136 author = {Abhiram Kothapalli and Srinath Setty},
137 title = {HyperNova: Recursive arguments for customizable constraint systems},
138 howpublished = {Cryptology ePrint Archive, Paper 2023/573},
139 year = {2023},
140 note = {\url{https://eprint.iacr.org/2023/573}},
141 url = {https://eprint.iacr.org/2023/573}
142}
143
144@ARTICLE{10177902,
145 author={Satriawan, Ardianto and Syafalni, Infall and Mareta, Rella and Anshori, Isa and Shalannanda, Wervyan and Barra, Aleams},
146 journal={IEEE Access},
147 title={Conceptual Review on Number Theoretic Transform and Comprehensive Review on Its Implementations},
148 year={2023},
149 volume={11},
150 number={},
151 pages={70288-70316},
152 keywords={Convolution;Complexity theory;Discrete Fourier transforms;Cryptography;Quantum computing;Homomorphic encryption;Toy manufacturing industry;Quantum computing;Number theoretic transform;post quantum cryptography;homomorphic encryption},
153 doi={10.1109/ACCESS.2023.3294446}
154}