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.

Ábel Kocsis

dblp:347/2032 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
0009-0009-6731-2555ORCID · reported

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

Systems, architecture and hardware · 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 · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › broadcast
simultaneous broadcast
0.712023
Universally Composable Simultaneous Broadcast against a Dishonest Majority and Applications · PODC 2023
Cryptographic protocols and secure computation › composable security
universally composable security
0.712023
Universally Composable Simultaneous Broadcast against a Dishonest Majority and Applications · PODC 2023
Cryptographic protocols and secure computation › adversarial model › corruption models
dishonest majority
0.212023
Universally Composable Simultaneous Broadcast against a Dishonest Majority and Applications · PODC 2023

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

universal composability framework · 0.7
YearPublicationVenuePosition
2023 Universally Composable Simultaneous Broadcast against a Dishonest Majority and Applications
abstract
Simultaneous broadcast (SBC) protocols, introduced in [Chor et al., FOCS 1985], constitute a special class of broadcast channels which, besides consistency, guarantee that all senders broadcast their messages independently of the messages broadcast by other parties. SBC has proved extremely useful in the design of various distributed computing constructions (e.g., multiparty computation, coin flipping, electronic voting, fair bidding). As with any communication channel, it is crucial that SBC security is composable, i.e., it is preserved under concurrent protocol executions. The work of [Hevia, SCN 2006] proposes a formal treatment of SBC in the state-of-the-art Universal Composability (UC) framework [Canetti, FOCS 2001] and a construction secure assuming an honest majority.
Myrto Arapinis, Ábel Kocsis, Nikolaos Lamprou, Liam Medley, Thomas Zacharias 0001
PODC2