Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Daniel Malinowski

dblp:138/8989 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 3

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
2 papers
Blockchain and cryptocurrency security · 87% Cryptographic protocols and secure computation · 13%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Blockchain and cryptocurrency security
off-chain protocols
0.412019
Perun: Virtual Payment Hubs over Cryptocurrencies · IEEE Symposium on Security and Privacy 2019
Blockchain and cryptocurrency security › off-chain payment
payment channel
0.412019
Perun: Virtual Payment Hubs over Cryptocurrencies · IEEE Symposium on Security and Privacy 2019
Blockchain and cryptocurrency security › off-chain payment › payment channel
virtual channel
0.412019
Perun: Virtual Payment Hubs over Cryptocurrencies · IEEE Symposium on Security and Privacy 2019
Cryptographic protocols and secure computation
secure multiparty computation
0.212014
Secure Multiparty Computations on Bitcoin · IEEE Symposium on Security and Privacy 2014
Blockchain and cryptocurrency security
smart contract
0.112019
Perun: Virtual Payment Hubs over Cryptocurrencies · IEEE Symposium on Security and Privacy 2019

Methods — techniques the papers use, named apart from their topics

smart contract implementation · 0.4formal security modeling · 0.4timed commitments · 0.2
YearPublicationVenuePosition
2019 Perun: Virtual Payment Hubs over Cryptocurrencies
abstract
Payment channels emerged recently as an efficient method for performing cheap micropayments in cryptocurrencies. In contrast to traditional on-chain transactions, payment channels have the advantage that they allow for nearly unlimited number of transactions between parties without involving the blockchain. In this work, we introduce Perun, an off-chain channel system that offers a new method for connecting channels that is more efficient than the existing technique of ``routing transactions'' over multiple channels. To this end, Perun introduces a technique called ``virtual payment channels'' that avoids involvement of the intermediary for each individual payment. In this paper we formally model and prove security of this technique in the case of one intermediary, who can be viewed as a ``payment hub'' that has direct channels with several parties. Our scheme works over any cryptocurrency that provides Turing-complete smart contracts. As a proof of concept, we implemented Perun's smart contracts in Ethereum.
Stefan Dziembowski, Lisa Eckey, Sebastian Faust, Daniel Malinowski
IEEE Symposium on Security and Privacy4
2016 Efficient Zero-Knowledge Contingent Payments in Cryptocurrencies Without Scripts
Waclaw Banasik, Stefan Dziembowski, Daniel Malinowski
ESORICS (2)3
2014 Secure Multiparty Computations on Bitcoin
abstract
Bit coin is a decentralized digital currency, introduced in 2008, that has recently gained noticeable popularity. Its main features are: (a) it lacks a central authority that controls the transactions, (b) the list of transactions is publicly available, and (c) its syntax allows more advanced transactions than simply transferring the money. The goal of this paper is to show how these properties of Bit coin can be used in the area of secure multiparty computation protocols (MPCs). Firstly, we show that the Bit coin system provides an attractive way to construct a version of "timed commitments", where the committer has to reveal his secret within a certain time frame, or to pay a fine. This, in turn, can be used to obtain fairness in some multiparty protocols. Secondly, we introduce a concept of multiparty protocols that work "directly on Bit coin". Recall that the standard definition of the MPCs guarantees only that the protocol "emulates the trusted third party". Hence ensuring that the inputs are correct, and the outcome is respected is beyond the scope of the definition. Our observation is that the Bit coin system can be used to go beyond the standard "emulation-based" definition, by constructing protocols that link their inputs and the outputs with the real Bit coin transactions. As an instantiation of this idea we construct protocols for secure multiparty lotteries using the Bit coin currency, without relying on a trusted authority (one of these protocols uses the Bit coin-based timed commitments mentioned above). Our protocols guarantee fairness for the honest parties no matter how the loser behaves. For example: if one party interrupts the protocol then her money is transferred to the honest participants. Our protocols are practical (to demonstrate it we performed their transactions in the actual Bit coin system), and can be used in real life as a replacement for the online gambling sites. We think that this paradigm can have also other applications. We discuss some of them.
Marcin Andrychowicz, Stefan Dziembowski, Daniel Malinowski, Lukasz Mazurek
IEEE Symposium on Security and Privacy3