A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Filters
A Note on the Post-Quantum Security of (Ring) Signatures
[article]
2021
arXiv
pre-print
(Eurocrypt'20). ...
In Jesper Buus Nielsen and Vincent Rijmen, editors, Advances in
Cryptology – EUROCRYPT 2018, Part III, volume 10822 of Lecture Notes in Computer Science, pages
552–586, Tel Aviv, Israel ...
Advances in Cryptology – EUROCRYPT 2016, Part II,
volume 9666 of Lecture Notes in Computer Science, Vienna, Austria, May 8–12, 2016. Springer, Heidelberg,
Germany. 41
GHHM20. ...
arXiv:2112.06078v1
fatcat:potybhcv7nfqbaw4ek5ggiklmu
An Efficient and Robust Committee Structure for Sharding Blockchain
[article]
2021
arXiv
pre-print
Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018
Optchain [23] provides a transaction assignment algo- Proceedings, Part II, ser. ...
2018 - 37th
Annual International Conference on the Theory and Applications of
channels. ...
arXiv:2112.15322v1
fatcat:uaqrt57nt5hhxm6lxl5zua4jmq
Scalable and Probabilistic Leaderless BFT Consensus through Metastability
[article]
2020
arXiv
pre-print
In Advances in Cryptology -EUROCRYPT 2018 -37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 -May 3, 2018 Proceedings, Part II ...
In Advances in Cryptology -EUROCRYPT 2015 -34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26-30, 2015, Proceedings, Part II (2015 ...
arXiv:1906.08936v2
fatcat:bj4nqc27qvh3nlk6nifhel5x5q
Dagstuhl Reports, Volume 9, Issue 1, January 2019, Complete Issue
[article]
2019
2018 -37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 -May 3, 2018 Proceedings, Part I, Lecture Notes in Computer Science, Vol ...
, Paris, France, October 7-9, 2018, pp. 182-193, IEEE Computer Society, 2018. ...
Known results: (i) CNF formulas have FPT-sized resolution refutations, parameterized by the pathwidth of the incidence graph [1] , and (ii) parameterized by the treewidth of the primal graph [3] . ...
doi:10.4230/dagrep.9.1
fatcat:m3grhk5hanccbg7oxkhos7kv4e