12 March 2020
Sayandeep Saha, Manaar Alam, Arnab Bag, Debdeep Mukhopadhyay, Pallab Dasgupta
Shigeo Tsujii, Toshiaki Saisho, Masao Yamasawa, Masahito Gotaishi, Kou Shikata, Koji Sasaki, Nobuharu Suzuki, Masaki Hashiyada
Christian Mouchet, Juan Troncoso-Pastoriza, Jean-Pierre Hubaux
Sergei Tikhomirov, Pedro Moreno-Sanchez, Matteo Maffei
Payment channels suffer from security vulnerabilities, such as the wormhole attack, anonymity issues, and scalability limitations related to the upper bound on the number of concurrent payments per channel, which have been pointed out by the scientific community but never quantitatively analyzed.
In this work, we first analyze the proneness of the LN to the wormhole attack and attacks against anonymity. We observe that an adversary needs to control only 2% of LN nodes to learn sensitive payment information (e.g., sender, receiver and payment amount) or to carry out the wormhole attack. Second, we study the management of concurrent payments in the LN and quantify its negative effect on scalability. We observe that for micropayments, the forwarding capability of up to 50% of channels is restricted to a value smaller than the overall channel capacity. This phenomenon not only hinders scalability but also opens the door for DoS attacks: We estimate that a network-wide DoS attack costs within 1.5M USD, while isolating the biggest community from the rest of the network costs only 225k USD.
Our findings should prompt the LN community to consider the security, privacy and scalability issues of the network studied in this work when educating users about path selection algorithms, as well as to adopt multi-hop payment protocols that provide stronger security, privacy and scalability guarantees.
Thomas Kaeding
Thomas Kaeding
10 March 2020
Nanjing City, China, 20 November - 22 November 2020
Submission deadline: 21 June 2020
Notification: 31 July 2020
Shanghai Jiao Tong University
Closing date for applications:
Contact: Chaoping Xing, emial: xingcp@sjtu.edu.cn Linjie Li, email: lilinjie@sjtu.edu.cn
More information: http://english.seiee.sjtu.edu.cn/english/info/14810.htm
Research Fellow
Closing date for applications:
Contact: For informal inquiries please contact Mark Ryan; ryanmd@adf.bham.uk
More information: https://bham.taleo.net/careersection/external/jobdetail.ftl?job=190005S3&tz=GMT%2B00%3A00&tzname=Europe%2FLondon
NuCypher; San Francisco, CA (remote possible)
NuCypher is a cryptography company that builds privacy-preserving infrastructure and protocols. We are backed by Y Combinator and Polychain Capital.
A successful candidate will lead engineering for the new open-source cryptographic product from the ground up. They will work on problems at the forefront of cryptography and have a leadership role in design decisions of the system. As such, competency in algorithms and low-level design is a must. An interest in compilers and/or optimization would be nice to have.
Given the nature of an early stage product, a successful candidate should work in a fast and iterative style when it comes to prototyping. They will be be motivated by solving tough open-ended problems. Additionally, they should be highly comfortable working in a system programming language such as C or Rust (whether through work experience or side projects).
We offer extremely competitive compensation and a highly flexible working environment (remote-first, headquartered in San Francisco).
Closing date for applications:
Contact: Ravital Solomon
Guildford, United Kingdom, 14 September - 18 September 2020
Submission deadline: 10 April 2020
Notification: 15 June 2020
York, United Kingdom, 11 June - 12 June 2020
09 March 2020
Yehuda Lindell
We note that the examples and references brought in this review article are far from comprehensive, and due to the lack of space many highly relevant works are not cited.
Manuel M. T. Chakravarty, Sandro Coretti, Matthias Fitzi, Peter Gazi, Philipp Kant, Aggelos Kiayias, Alexander Russell
Nir Drucker, Shay Gueron, Dusan Kostic
Koen de Boer, Léo Ducas, Alice Pellet-Mary, Benjamin Wesolowski
In the present article, we show that the Arakelov class group has more to offer. We start with the development of a new versatile tool: we prove that, subject to the Riemann Hypothesis for Hecke $L$-functions, certain random walks on the Arakelov class group have a rapid mixing property. We then exploit this result to relate the average-case and the worst-case of the Shortest Vector Problem in ideal lattices. Our reduction appears particularly sharp: for Hermite-SVP in ideal lattices of certain cyclotomic number fields, it loses no more than a $\tilde O(\sqrt n)$ factor on the Hermite approximation factor.
Furthermore, we suggest that this rapid-mixing theorem should find other applications in cryptography and in algorithmic number theory.
Akshima, David Cash, Francesca Falzon, Adam Rivkin, Jesse Stern
Lilya Budaghyan, Marco Calderini, Claude Carlet, Robert Coulter, Irene Villa
Olivier Blazy, Patrick Towa, Damien Vergnaud
08 March 2020
As a consequence of the COVID-19 crisis, the Greek Health ministry took on March 8 the decision to suspend all conference events for the next four weeks (the announcement in Greek can be found here.).
Under these force majeure circumstances, FSE 2020 is postponed.
More details will follow soon.
For any questions please contact the General Chairs at fse2020@iacr.org