Ida Tucker

dblp:225/9869 · DBLP profile ↗
← Back
10ranked-venue papers
0as first author
8since 2021 · last 2025
0000-0003-4895-5896ORCID · verified

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

Security and privacy · 7 · 5 since 2021Theory of computation · 3 · 3 since 2021
YearPublicationVenuePosition
2025 Comprehensive Deniability Analysis of Signal Handshake Protocols: X3DH, PQXDH to Fully Post-Quantum with Deniable Ring Signatures
Shuichi Katsumata, Guilhem Niot, Ida Tucker, Thom Wiggers
USENIX Security Symposium3
2023 Bandwidth-efficient threshold EC-DSA revisited: Online/offline extensions, identifiable aborts proactive and adaptive security
Guilhem Castagnos, Dario Catalano, Fabien Laguillaumie, Federico Savasta, Ida Tucker
Theor. Comput. Sci.5
2022 Threshold Linearly Homomorphic Encryption on bfZ/2kbfZ
Guilhem Castagnos, Fabien Laguillaumie, Ida Tucker
ASIACRYPT (2)3
2022 Additive-Homomorphic Functional Commitments and Applications to Homomorphic Signatures
Dario Catalano, Dario Fiore 0001, Ida Tucker
ASIACRYPT (4)3
2022 Efficient Zero-Knowledge Proofs on Signed Data with Applications to Verifiable Computation on Data Streams
abstract
We study the problem of privacy-preserving proofs on streamed authenticated data. In this setting, a server receives a continuous stream of data from a trusted data provider, and is requested to prove computations over the data to third parties in a correct and private way. In particular, the third party learns no information on the data beyond the validity of claimed results. A challenging requirement here, is that the third party verifies the validity with respect to the specific data authenticated by the provider, while communicating only with the server. This problem is motivated by various application areas, ranging from stock-market monitoring and prediction services; to the publication of government-ran statistics on large healthcare databases. All of these applications require a reliable and scalable solution, in order to see practical adoption.
Dario Fiore 0001, Ida Tucker
CCS2
2022 Ring Signatures with User-Controlled Linkability
Dario Fiore 0001, Lydia Garms, Dimitris Kolonelos, Claudio Soriente, Ida Tucker
ESORICS (2)5
2022 A tighter proof for CCA secure inner product functional encryption: Genericity meets efficiency
Guilhem Castagnos, Fabien Laguillaumie, Ida Tucker
Theor. Comput. Sci.3
2021 Hardware security without secure hardware: How to decrypt with a password and a server
Olivier Blazy, Laura Brouilhet, Céline Chevalier, Patrick Towa, Ida Tucker, Damien Vergnaud
Theor. Comput. Sci.5
2019 Two-Party ECDSA from Hash Proof Systems and Efficient Instantiations
Guilhem Castagnos, Dario Catalano, Fabien Laguillaumie, Federico Savasta, Ida Tucker
CRYPTO (3)5
2018 Practical Fully Secure Unrestricted Inner Product Functional Encryption Modulo p
Guilhem Castagnos, Fabien Laguillaumie, Ida Tucker
ASIACRYPT (2)3