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

David Balbás

dblp:305/9043 · DBLP profile ↗
← Back
8ranked-venue papers
5as first author
8since 2021 · last 2026
0000-0003-4864-1125ORCID · corroborated

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

Security and privacy · 8 · 5 first-author · 8 since 2021Theory of computation · 1 · 1 first-author · 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
6 papers
Cryptographic protocols and secure computation · 73% Cryptographic primitives and cryptanalysis · 24% Security and privacy of machine learning · 2%
Computer graphics and multimedia
1 paper
Image and video processing · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation
commitment schemes
1.012026
Critical Rounds in Multi-round Proofs: Proof of Partial Knowledge and Trapdoor Commitments · EUROCRYPT (7) 2026
Cryptographic protocols and secure computation › key exchange
group key agreement
1.012026
Group Key Progression: Strong Security for Shared Persistent Data · EUROCRYPT (2) 2026
Cryptographic protocols and secure computation
interactive proofs
1.012026
Critical Rounds in Multi-round Proofs: Proof of Partial Knowledge and Trapdoor Commitments · EUROCRYPT (7) 2026
Cryptographic protocols and secure computation › commitment schemes
trapdoor commitments
1.012026
Critical Rounds in Multi-round Proofs: Proof of Partial Knowledge and Trapdoor Commitments · EUROCRYPT (7) 2026
Cryptographic primitives and cryptanalysis › public-key cryptography
digital signatures
0.812024
Fully-Succinct Multi-key Homomorphic Signatures from Standard Assumptions · CRYPTO (3) 2024
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
homomorphic signatures
0.812024
Fully-Succinct Multi-key Homomorphic Signatures from Standard Assumptions · CRYPTO (3) 2024
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › homomorphic signatures
multi-key homomorphic signatures
0.812024
Fully-Succinct Multi-key Homomorphic Signatures from Standard Assumptions · CRYPTO (3) 2024
Cryptographic protocols and secure computation
proof systems
0.712023
Modular Sumcheck Proofs with Applications to Machine Learning and Image Processing · CCS 2023
Cryptographic protocols and secure computation › secure messaging
secure group messaging
0.712023
Cryptographic Administration for Secure Group Messaging · USENIX Security Symposium 2023
Cryptographic protocols and secure computation
secure messaging
0.712023
WhatsUpp with Sender Keys? Analysis, Improvements and Security Proofs · ASIACRYPT (5) 2023
Cryptographic protocols and secure computation › proof systems
sumcheck protocol
0.712023
Modular Sumcheck Proofs with Applications to Machine Learning and Image Processing · CCS 2023
Cryptographic protocols and secure computation
key management
0.212023
Cryptographic Administration for Secure Group Messaging · USENIX Security Symposium 2023
Security and privacy of machine learning
verifiable machine learning
0.212023
Modular Sumcheck Proofs with Applications to Machine Learning and Image Processing · CCS 2023

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

sumcheck protocol · 1.3proof of partial knowledge · 1.0sender keys · 0.7
YearPublicationVenuePosition
2026 Splitting Bilinear Groups: New Translations from Composite- to Prime-Order with Applications to Batch Arguments for NP
David Balbás, Dario Fiore 0001
CRYPTO (9)1
2026 Critical Rounds in Multi-round Proofs: Proof of Partial Knowledge and Trapdoor Commitments
Masayuki Abe, David Balbás, Dung Bui, Miyako Ohkubo, Zehua Shang, Akira Takahashi 0002, Mehdi Tibouchi
EUROCRYPT (7)2
2026 Group Key Progression: Strong Security for Shared Persistent Data
Matilda Backendal, David Balbás, Miro Haller
EUROCRYPT (2)2
2024 Fully-Succinct Multi-key Homomorphic Signatures from Standard Assumptions
Gaspard Anthoine, David Balbás, Dario Fiore 0001
CRYPTO (3)2
2023 WhatsUpp with Sender Keys? Analysis, Improvements and Security Proofs
David Balbás, Daniel Collins 0001, Phillip Gajland
ASIACRYPT (5)1
2023 Modular Sumcheck Proofs with Applications to Machine Learning and Image Processing
abstract
Cryptographic proof systems provide integrity, fairness, and privacy in applications that outsource data processing tasks. However, general-purpose proof systems do not scale well to large inputs. At the same time, ad-hoc solutions for concrete applications - e.g., machine learning or image processing - are more efficient but lack modularity, hence they are hard to extend or to compose with other tools of a data-processing pipeline.
David Balbás, Dario Fiore 0001, María Isabel González Vasco, Damien Robissout, Claudio Soriente
CCS1
2023 Chainable Functional Commitments for Unbounded-Depth Circuits
David Balbás, Dario Catalano, Dario Fiore 0001, Russell W. F. Lai
TCC (3)1
2023 Cryptographic Administration for Secure Group Messaging
David Balbás, Daniel Collins 0001, Serge Vaudenay
USENIX Security Symposium1