Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Zeta Avarikioti"'
Publikováno v:
Structural Information and Communication Complexity ISBN: 9783031327322
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d3eb694fdf5a15b38d956b2a022aba32
https://doi.org/10.1007/978-3-031-32733-9_10
https://doi.org/10.1007/978-3-031-32733-9_10
Autor:
Zeta Avarikioti, Lioba Heimbach, Roland Schmid, Laurent Vanbever, Roger Wattenhofer, Patrick Wintermeyer
Publikováno v:
Structural Information and Communication Complexity ISBN: 9783031327322
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ed05572b2dc2bac1e54574b54c9aa8ff
https://doi.org/10.1007/978-3-031-32733-9_9
https://doi.org/10.1007/978-3-031-32733-9_9
Autor:
Zeta Avarikioti, Krzysztof Pietrzak, Iosif Salem, Stefan Schmid, Samarth Tiwari, Michelle Yeo
Publikováno v:
Financial Cryptography and Data Security ISBN: 9783031182822
Payment channels effectively move the transaction load off-chain thereby successfully addressing the inherent scalability problem most cryptocurrencies face. A major drawback of payment channels is the need to “top up” funds on-chain when a chann
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5cda936e97bb14def5ae56b83e15a95d
https://ir.cwi.nl/pub/32640
https://ir.cwi.nl/pub/32640
Publikováno v:
Financial Cryptography and Data Security ISBN: 9783031182822
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eff0929abf30d2aac4cad84233c3f99f
https://doi.org/10.1007/978-3-031-18283-9_24
https://doi.org/10.1007/978-3-031-18283-9_24
Publikováno v:
Financial Cryptography and Data Security ISBN: 9783662643303
Financial Cryptography (2)
Financial Cryptography (2)
Off-chain protocols (channels) are a promising solution to the scalability and privacy challenges of blockchain payments. Current proposals, however, require synchrony assumptions to preserve the safety of a channel, leaking to an adversary the exact
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e8fc08cad3217b7d47549ecba005040
https://doi.org/10.1007/978-3-662-64331-0_11
https://doi.org/10.1007/978-3-662-64331-0_11
Publikováno v:
Financial Cryptography and Data Security ISBN: 9783030512798
Financial Cryptography
Financial Cryptography
Payment channels were introduced to solve various eminent cryptocurrency scalability issues. Multiple payment channels build a network on top of a blockchain, the so-called layer 2. In this work, we analyze payment networks through the lens of networ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::71790ce12ddc399d173ebaf9d7dc8e7d
https://doi.org/10.1007/978-3-030-51280-4_15
https://doi.org/10.1007/978-3-030-51280-4_15
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030661717
DPM/CBT@ESORICS
DPM/CBT@ESORICS
Cryptocurrency light- or simplified payment verification (SPV) clients allow nodes with limited resources to efficiently verify execution of payments. Instead of downloading the entire blockchain, only block headers and selected transactions are stor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2db870400af2bcb8b11f2fd1e7875d90
https://doi.org/10.1007/978-3-030-66172-4_18
https://doi.org/10.1007/978-3-030-66172-4_18
Publikováno v:
Financial Cryptography and Data Security ISBN: 9783030512798
Financial Cryptography
Financial Cryptography
Bitcoin and similar blockchain systems have a limited transaction throughput because each transaction must be processed by all parties, on-chain. Payment channels relieve the blockchain by allowing parties to execute transactions off-chain while main
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d1e3ef1bb69602e194fc80fb246b842d
https://doi.org/10.1007/978-3-030-51280-4_19
https://doi.org/10.1007/978-3-030-51280-4_19
Publikováno v:
Algorithmica
Algorithmica, 2020, 82 (6), pp.1675-1702. ⟨10.1007/s00453-019-00664-8⟩
SODA: ACM/SIAM Symposium on Discrete Algorithms
SODA: ACM/SIAM Symposium on Discrete Algorithms, Jan 2017, Barcelone, Spain
Algorithmica, Springer Verlag, 2020, 82 (6), pp.1675-1702. ⟨10.1007/s00453-019-00664-8⟩
HAL
Scopus-Elsevier
Algorithmica, 2020, 82 (6), pp.1675-1702. ⟨10.1007/s00453-019-00664-8⟩
SODA: ACM/SIAM Symposium on Discrete Algorithms
SODA: ACM/SIAM Symposium on Discrete Algorithms, Jan 2017, Barcelone, Spain
Algorithmica, Springer Verlag, 2020, 82 (6), pp.1675-1702. ⟨10.1007/s00453-019-00664-8⟩
HAL
Scopus-Elsevier
The construction of $r$-nets offers a powerful tool in computational and metric geometry. We focus on high-dimensional spaces and present a new randomized algorithm which efficiently computes approximate $r$-nets with respect to Euclidean distance. F
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c4c49f0618d483c76fee8ade218e65a6
https://doi.org/10.1137/1.9781611974782.2
https://doi.org/10.1137/1.9781611974782.2
