Philipp Jovanovic
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Philipp Jovanovic has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Alberto Sonnino
Mysten Labs & University College London, London, United Kingdom
2 shared publications - Nicolas Mohnblatt
ZkSecurity
2 shared publications - Arthur Gervais
University College London, London, United Kingdom
1 shared publication - Bryan Ford
Yale University
1 shared publication - Cristina Basescu
DEDIS, Ecole Polytechnique Federale de Lausanne (EPFL), Lausanne, Vaud, Switzerland
1 shared publication - Ewa Syta
Department of Computer Science, Trinity College, Hartford, Connecticut, USA
1 shared publication
Latest Publications
- Open Access
- 3 August 2026
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 3 (2)
eDAS: Extending Data Availability Sampling with Privacy and Compliance
A data availability sampling scheme (DAS) allows a network of verifiers to collectively ensure that an untrusted party is correctly storing and distributing some committed data. Importantly, the protocol should not require that the verifiers coordinate or store the full data individually. In this paper, we initiate the study of privacy in DAS schemes: we ask whether the DAS guarantees can be upheld while keeping the committed data secret. We define a natural notion of zero-knowledge for DAS and show that no secure DAS scheme can satisfy this notion. In doing so, we motivate the need to study privacy-preserving variants of DAS. We define eDAS as DAS schemes over encrypted data and introduce the necessary security notions; namely, completeness, soundness and consistency. We additionally define a notion of privacy (zero-knowledge) and compliance (policy-enforcing). We then present two constructions of eDAS schemes. The first uses a DAS scheme as a black box and can be deployed on top of existing production-ready DAS systems with only minor modifications. The second is a more efficient construction that relies on the same principles but removes various layers of abstraction.
- 3 August 2026
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 3 (2)
Open AccesseDAS: Extending Data Availability Sampling with Privacy and Compliance
A data availability sampling scheme (DAS) allows a network of verifiers to collectively ensure that an untrusted party is correctly storing and distributing some committed data. Importantly, the protocol should not require that the verifiers coordinate or store the full data individually. In this paper, we initiate the study of privacy in DAS schemes: we ask whether the DAS guarantees can be upheld while keeping the committed data secret. We define a natural notion of zero-knowledge for DAS and show that no secure DAS scheme can satisfy this notion. In doing so, we motivate the need to study privacy-preserving variants of DAS. We define eDAS as DAS schemes over encrypted data and introduce the necessary security notions; namely, completeness, soundness and consistency. We additionally define a notion of privacy (zero-knowledge) and compliance (policy-enforcing). We then present two constructions of eDAS schemes. The first uses a DAS scheme as a black box and can be deployed on top of existing production-ready DAS systems with only minor modifications. The second is a more efficient construction that relies on the same principles but removes various layers of abstraction.
- Open Access
- 2 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 3212-3226
Arke: Scalable and Byzantine Fault Tolerant Privacy-Preserving Contact Discovery
Contact discovery is a crucial component of social applications, facilitating interactions between registered contacts. This work introduces Arke, a novel contact discovery scheme that addresses the limitations of existing solutions in terms of privacy, scalability, and reliance on trusted third parties. Arke ensures the unlinkability of user interactions, mitigates enumeration attacks, and operates without single points of failure or trust. Notably, Arke is the first contact discovery system whose performance is independent of the total number of users and the first that can operate in a Byzantine setting. It achieves its privacy goals through an unlinkable handshake mechanism built on top of an identity-based non-interactive key exchange. By leveraging a custom distributed architecture, Arke forgoes the expense of consensus to achieve scalability while maintaining consistency in an adversarial environment. Performance evaluations demonstrate that Arke provides a throughput of over 1,500 user requests per second at a latency of less than 0.5 seconds in a large geo-distributed setting which would allow privacy-preserving contact discovery for all of the popular messaging applications in one system.
- 2 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 3212-3226
Open AccessArke: Scalable and Byzantine Fault Tolerant Privacy-Preserving Contact Discovery
Contact discovery is a crucial component of social applications, facilitating interactions between registered contacts. This work introduces Arke, a novel contact discovery scheme that addresses the limitations of existing solutions in terms of privacy, scalability, and reliance on trusted third parties. Arke ensures the unlinkability of user interactions, mitigates enumeration attacks, and operates without single points of failure or trust. Notably, Arke is the first contact discovery system whose performance is independent of the total number of users and the first that can operate in a Byzantine setting. It achieves its privacy goals through an unlinkable handshake mechanism built on top of an identity-based non-interactive key exchange. By leveraging a custom distributed architecture, Arke forgoes the expense of consensus to achieve scalability while maintaining consistency in an adversarial environment. Performance evaluations demonstrate that Arke provides a throughput of over 1,500 user requests per second at a latency of less than 0.5 seconds in a large geo-distributed setting which would allow privacy-preserving contact discovery for all of the popular messaging applications in one system.
- 1 December 2023
- Published by Springer Nature
- p. 344-362
Mitigating Decentralized Finance Liquidations with Reversible Call Options
- 1 December 2023
- Published by Springer Nature
- p. 344-362
Mitigating Decentralized Finance Liquidations with Reversible Call Options
- Open Access
- 23 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 281-297
QuePaxa: Escaping the tyranny of timeouts in consensus
- 23 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 281-297
Open AccessQuePaxa: Escaping the tyranny of timeouts in consensus
- Open Access
- 19 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-5
Performance of EdDSA and BLS Signatures in Committee-Based Consensus
We present the first performance comparison of EdDSA and BLS signatures in committee-based consensus protocols through large-scale geo-distributed benchmarks. Contrary to popular beliefs, we find that small deployments (less than 40 validators) can benefit from the small storage footprint of BLS multi-signatures while larger deployments should favor EdDSA to improve performance. As an independent contribution, we present a novel way for committee-based consensus protocols to verify BLS multi-signed certificates by manipulating the aggregated public key using pre-computed values.
- 19 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-5
Open AccessPerformance of EdDSA and BLS Signatures in Committee-Based Consensus
We present the first performance comparison of EdDSA and BLS signatures in committee-based consensus protocols through large-scale geo-distributed benchmarks. Contrary to popular beliefs, we find that small deployments (less than 40 validators) can benefit from the small storage footprint of BLS multi-signatures while larger deployments should favor EdDSA to improve performance. As an independent contribution, we present a novel way for committee-based consensus protocols to verify BLS multi-signed certificates by manipulating the aggregated public key using pre-computed values.
- Open Access
- 1 July 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4236 (19429398) , 43-48
Precise fault-injections using voltage and temperature manipulation for differential cryptanalysis
State-of-the-art fault-based cryptanalysis methods are capable of breaking most recent ciphers after only a few fault injections. However, they require temporal and spatial accuracies of fault injection that were believed to rule out low-cost injection techniques such as voltage, frequency or temperature manipulation. We investigate selection of supply-voltage and temperature values that are suitable for high-precision fault injection even up to a single bit. The object of our studies is an ASIC implementation of the recently presented block cipher PRINCE, for which a two-stage fault attack scheme has been suggested lately. This attack requires, on average, about four to five fault injections in well-defined locations. We show by electrical simulations that voltage-temperature points exist for which faults show up at locations required for a successful attack with a likelihood of around 0.1%. This implies that the complete attack can be mounted by approximately 4,000 to 5,000 fault injection attempts, which is clearly feasible.
- 1 July 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4236 (19429398) , 43-48
Open AccessPrecise fault-injections using voltage and temperature manipulation for differential cryptanalysis
State-of-the-art fault-based cryptanalysis methods are capable of breaking most recent ciphers after only a few fault injections. However, they require temporal and spatial accuracies of fault injection that were believed to rule out low-cost injection techniques such as voltage, frequency or temperature manipulation. We investigate selection of supply-voltage and temperature values that are suitable for high-precision fault injection even up to a single bit. The object of our studies is an ASIC implementation of the recently presented block cipher PRINCE, for which a two-stage fault attack scheme has been suggested lately. This attack requires, on average, about four to five fault injections in well-defined locations. We show by electrical simulations that voltage-temperature points exist for which faults show up at locations required for a successful attack with a likelihood of around 0.1%. This implies that the complete attack can be mounted by approximately 4,000 to 5,000 fault injection attempts, which is clearly feasible.