Demo Data from SIGIR 2026 / reviewers in the wild / expert
Ida Tucker
dblp:225/9869
· DBLP profile ↗
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
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 primitives and cryptanalysis · 63% Cryptographic protocols and secure computation · 30% Privacy and data protection · 7% | |
| Databases, data mining, and information retrieval
1 paper |
Data stream processing · 100% |
Topics — the 16 heaviest of 18, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation
key exchange |
0.9 | 1 | 2025 | Comprehensive Deniability Analysis of Signal Handshake Protocols: X3DH, PQXDH to Fully Post-Quantum with Deniable Ring Signatures · USENIX Security Symposium 2025 |
Cryptographic primitives and cryptanalysis
post-quantum cryptography |
0.9 | 1 | 2025 | Comprehensive Deniability Analysis of Signal Handshake Protocols: X3DH, PQXDH to Fully Post-Quantum with Deniable Ring Signatures · USENIX Security Symposium 2025 |
Cryptographic primitives and cryptanalysis › public-key cryptography
digital signatures |
0.7 | 2 | 2022 | Additive-Homomorphic Functional Commitments and Applications to Homomorphic Signatures · ASIACRYPT (4) 2022 Two-Party ECDSA from Hash Proof Systems and Efficient Instantiations · CRYPTO (3) 2019 |
Cryptographic primitives and cryptanalysis › cryptographic foundations › cryptographic commitments
functional commitments |
0.6 | 1 | 2022 | Additive-Homomorphic Functional Commitments and Applications to Homomorphic Signatures · ASIACRYPT (4) 2022 |
Cryptographic primitives and cryptanalysis › cryptographic foundations › cryptographic commitments
homomorphic commitments |
0.6 | 1 | 2022 | Additive-Homomorphic Functional Commitments and Applications to Homomorphic Signatures · ASIACRYPT (4) 2022 |
Cryptographic primitives and cryptanalysis
homomorphic encryption |
0.6 | 1 | 2022 | Threshold Linearly Homomorphic Encryption on bfZ/2kbfZ · ASIACRYPT (2) 2022 |
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
homomorphic signatures |
0.6 | 1 | 2022 | Additive-Homomorphic Functional Commitments and Applications to Homomorphic Signatures · ASIACRYPT (4) 2022 |
Privacy and data protection
privacy-preserving computation |
0.6 | 1 | 2022 | Efficient Zero-Knowledge Proofs on Signed Data with Applications to Verifiable Computation on Data Streams · CCS 2022 |
Cryptographic protocols and secure computation
threshold cryptography |
0.6 | 1 | 2022 | Threshold Linearly Homomorphic Encryption on bfZ/2kbfZ · ASIACRYPT (2) 2022 |
Cryptographic protocols and secure computation › threshold cryptography
threshold homomorphic encryption |
0.6 | 1 | 2022 | Threshold Linearly Homomorphic Encryption on bfZ/2kbfZ · ASIACRYPT (2) 2022 |
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs |
0.6 | 1 | 2022 | Efficient Zero-Knowledge Proofs on Signed Data with Applications to Verifiable Computation on Data Streams · CCS 2022 |
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
threshold signature |
0.4 | 1 | 2019 | Two-Party ECDSA from Hash Proof Systems and Efficient Instantiations · CRYPTO (3) 2019 |
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › threshold signature
two-party ECDSA |
0.4 | 1 | 2019 | Two-Party ECDSA from Hash Proof Systems and Efficient Instantiations · CRYPTO (3) 2019 |
Cryptographic primitives and cryptanalysis
functional encryption |
0.3 | 1 | 2018 | Practical Fully Secure Unrestricted Inner Product Functional Encryption Modulo p · ASIACRYPT (2) 2018 |
Cryptographic primitives and cryptanalysis › functional encryption
inner product functional encryption |
0.3 | 1 | 2018 | Practical Fully Secure Unrestricted Inner Product Functional Encryption Modulo p · ASIACRYPT (2) 2018 |
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › discrete logarithm signature
ECDSA |
0.1 | 1 | 2019 | Two-Party ECDSA from Hash Proof Systems and Efficient Instantiations · CRYPTO (3) 2019 |
Methods — techniques the papers use, named apart from their topics
zero-knowledge proofs · 1.1authenticated data structure · 1.1formal analysis · 0.9linearly homomorphic encryption · 0.6additive homomorphism · 0.6hash proof system · 0.4pairing-based cryptography · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 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 Symposium | 3 |
| 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 StreamsabstractWe 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 |
CCS | 2 |
| 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 |