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

Márk Melczer

dblp:202/7199 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · unresolved

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

Security and privacy · 1 · 1 since 2021

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
1 paper
Cryptographic protocols and secure computation · 44% Cryptographic primitives and cryptanalysis · 44% Blockchain and cryptocurrency security · 13%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation
fair exchange
0.812024
Atomic and Fair Data Exchange via Blockchain · CCS 2024
Cryptographic primitives and cryptanalysis › encryption
verifiable encryption
0.812024
Atomic and Fair Data Exchange via Blockchain · CCS 2024
Blockchain and cryptocurrency security › blockchain data management
data availability
0.212024
Atomic and Fair Data Exchange via Blockchain · CCS 2024

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

commitment scheme · 0.8KZG polynomial commitments · 0.8
YearPublicationVenuePosition
2024 Atomic and Fair Data Exchange via Blockchain
abstract
We introduce a blockchain Fair Data Exchange (FDE) protocol, enabling a storage server to transfer a data file to a client atomically: the client receives the file if and only if the server receives an agreed-upon payment. We put forth a new definition for a cryptographic scheme that we name verifiable encryption under committed key (VECK), and we propose two instantiations for this scheme. Our protocol relies on a blockchain to enforce the atomicity of the exchange and uses VECK to ensure that the client receives the correct data (matching an agreed-upon commitment) before releasing the payment for the decrypting key. Our protocol is trust-minimized and requires only constant-sized on-chain communication, concretely 3 signatures, 1 verification key, and 1 secret key, with most of the data stored and communicated off-chain. It also supports exchanging only a subset of the data, can amortize the server's work across multiple clients, and offers a general framework to design alternative FDE protocols using different commitment schemes. A prominent application of our protocol is the Danksharding data availability scheme on Ethereum, which commits to data via KZG polynomial commitments. We also provide an open-source implementation for our protocol with both instantiations for VECK, demonstrating our protocol's efficiency and practicality on Ethereum.
Ertem Nusret Tas, István András Seres, Márk Melczer, Mahimna Kelkar, Joseph Bonneau, Valeria Nikolaenko
CCS4