Staal A. Vinterbo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Staal A. Vinterbo has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Amir Zarei
Norwegian University of Science and Technology
3 shared publications - Sanjay R. Mehta
Division of Infectious Diseases and Global Public Health, University of California San Diego, CA, USA
3 shared publications - Cynthia E. Schairer
University of California, San Diego, USA
1 shared publication - David Nurkse
School of Medicine, UCSD, San Diego, CA, USA
1 shared publication - Dustin Wailes
School of Medicine, UCSD, San Diego, CA, USA
1 shared publication - Eliah Aronoff-Spencer
Division of Infectious Diseases and Global Public Health, University of California San Diego
1 shared publication
Latest Publications
- Open Access
- 9 January 2026
- Published by Springer Nature in SN Computer Science
- Vol. 7 (1) , 77
Hole-Free Differentially Private Multiparty Laplace Mechanism
Differential privacy (DP) employs noise addition methods to protect individual data privacy. These methods integrate a controlled quantity of random noise into a database query response to obscure the presence of any specific individual in the dataset. Previous studies exposed challenges when a query response is calculated using standard numerical formats like floating-point or fixed-point arithmetic, which can lead to output limitations that potentially compromise privacy protections. To overcome these challenges, the Google DP team developed algorithms to approximate the Laplace and Gaussian mechanisms. These algorithms generate noise from discrete distributions and round the query response to a predetermined level of precision. Building on this research, our study introduces three multiparty computation protocols to implement the Laplace mechanism. These protocols are specifically designed for linear queries and can handle real-valued functions on floating-point inputs. They offer information-theoretic security against passive adversaries, with potential extensions for protection against malicious threats. The three protocols cater to different application needs by balancing interactive operations, round complexities, and failure probabilities. Not only do our proposed protocols adhere to the strict standards of DP, but they also enhance the application to real-valued queries, showcasing their practicality and effectiveness.
- 9 January 2026
- Published by Springer Nature in SN Computer Science
- Vol. 7 (1) , 77
Open AccessHole-Free Differentially Private Multiparty Laplace Mechanism
Differential privacy (DP) employs noise addition methods to protect individual data privacy. These methods integrate a controlled quantity of random noise into a database query response to obscure the presence of any specific individual in the dataset. Previous studies exposed challenges when a query response is calculated using standard numerical formats like floating-point or fixed-point arithmetic, which can lead to output limitations that potentially compromise privacy protections. To overcome these challenges, the Google DP team developed algorithms to approximate the Laplace and Gaussian mechanisms. These algorithms generate noise from discrete distributions and round the query response to a predetermined level of precision. Building on this research, our study introduces three multiparty computation protocols to implement the Laplace mechanism. These protocols are specifically designed for linear queries and can handle real-valued functions on floating-point inputs. They offer information-theoretic security against passive adversaries, with potential extensions for protection against malicious threats. The three protocols cater to different application needs by balancing interactive operations, round complexities, and failure probabilities. Not only do our proposed protocols adhere to the strict standards of DP, but they also enhance the application to real-valued queries, showcasing their practicality and effectiveness.
- 21 December 2024
- Published by Springer Nature
- p. 66-81
Statistically Secure Multiparty Computation of a Biased Coin
- 21 December 2024
- Published by Springer Nature
- p. 66-81
Statistically Secure Multiparty Computation of a Biased Coin
- 1 March 2024
- Published by Springer Nature
- p. 310-320
Secure Multiparty Sampling of a Biased Coin for Differential Privacy
- 1 March 2024
- Published by Springer Nature
- p. 310-320
Secure Multiparty Sampling of a Biased Coin for Differential Privacy
- 3 May 2019
- Published by Taylor & Francis in AJOB Empirical Bioethics
- Vol. 10 (3) , 201-213
Trust and Expectations of Researchers and Public Health Departments for the Use of HIV Molecular Epidemiology
Background: Molecular epidemiology (ME) is a technique used to study the dynamics of pathogen transmission through a population. When used to study HIV infections, ME generates powerful information about how HIV is transmitted, including epidemiologic patterns of linkage and, potentially, transmission direction. Thus, ME raises challenging questions about the most responsible way to protect individual privacy while acquiring and using these data to advance public health and inform HIV intervention strategies. Here, we report on stakeholders’ expectations for how researchers and public health agencies might use HIV ME. Methods: We conducted in-depth semistructured interviews with 40 key stakeholders to find out how these individuals respond to the proposed risks and benefits of HIV ME. Transcripts were coded and analyzed using Atlas.ti. Expectations were assessed through analysis of responses to hypothetical scenarios designed to help interviewees think through the implications of this emerging technique in the contexts of research and public health. Results: Our analysis reveals a wide range of imagined responsibilities, capabilities, and trustworthiness of researchers and public health agencies. Specifically, many respondents expect researchers and public health agencies to use HIV ME carefully and maintain transparency about how data will be used. Informed consent was discussed as an important opportunity for notification of privacy risks. Furthermore, some respondents wished that public health agencies were held to the same form of oversight and accountability represented by informed consent in research. Conclusions: To prevent HIV ME from becoming a barrier to testing or a source of public mistrust, the sense of vulnerability expressed by some respondents must be addressed. In research, informed consent is an obvious opportunity for this. Without giving specimen donors a similar opportunity to opt out, public health agencies may find it difficult to adopt HIV ME without deterring testing and treatment.
- 3 May 2019
- Published by Taylor & Francis in AJOB Empirical Bioethics
- Vol. 10 (3) , 201-213
Trust and Expectations of Researchers and Public Health Departments for the Use of HIV Molecular Epidemiology
Background: Molecular epidemiology (ME) is a technique used to study the dynamics of pathogen transmission through a population. When used to study HIV infections, ME generates powerful information about how HIV is transmitted, including epidemiologic patterns of linkage and, potentially, transmission direction. Thus, ME raises challenging questions about the most responsible way to protect individual privacy while acquiring and using these data to advance public health and inform HIV intervention strategies. Here, we report on stakeholders’ expectations for how researchers and public health agencies might use HIV ME. Methods: We conducted in-depth semistructured interviews with 40 key stakeholders to find out how these individuals respond to the proposed risks and benefits of HIV ME. Transcripts were coded and analyzed using Atlas.ti. Expectations were assessed through analysis of responses to hypothetical scenarios designed to help interviewees think through the implications of this emerging technique in the contexts of research and public health. Results: Our analysis reveals a wide range of imagined responsibilities, capabilities, and trustworthiness of researchers and public health agencies. Specifically, many respondents expect researchers and public health agencies to use HIV ME carefully and maintain transparency about how data will be used. Informed consent was discussed as an important opportunity for notification of privacy risks. Furthermore, some respondents wished that public health agencies were held to the same form of oversight and accountability represented by informed consent in research. Conclusions: To prevent HIV ME from becoming a barrier to testing or a source of public mistrust, the sense of vulnerability expressed by some respondents must be addressed. In research, informed consent is an obvious opportunity for this. Without giving specimen donors a similar opportunity to opt out, public health agencies may find it difficult to adopt HIV ME without deterring testing and treatment.
- Open Access
- 27 April 2019
- Published by Springer Nature in BMC Medical Informatics and Decision Making
- Vol. 19 (1) , 1-7
An open access medical knowledge base for community driven diagnostic decision support system development
While early diagnostic decision support systems were built around knowledge bases, more recent systems employ machine learning to consume large amounts of health data. We argue curated knowledge bases will remain an important component of future diagnostic decision support systems by providing ground truth and facilitating explainable human-computer interaction, but that prototype development is hampered by the lack of freely available computable knowledge bases. We constructed an open access knowledge base and evaluated its potential in the context of a prototype decision support system. We developed a modified set-covering algorithm to benchmark the performance of our knowledge base compared to existing platforms. Testing was based on case reports from selected literature and medical student preparatory material. The knowledge base contains over 2000 ICD-10 coded diseases and 450 RX-Norm coded medications, with over 8000 unique observations encoded as SNOMED or LOINC semantic terms. Using 117 medical cases, we found the accuracy of the knowledge base and test algorithm to be comparable to established diagnostic tools such as Isabel and DXplain. Our prototype, as well as DXplain, showed the correct answer as “best suggestion” in 33% of the cases. While we identified shortcomings during development and evaluation, we found the knowledge base to be a promising platform for decision support systems. We built and successfully evaluated an open access knowledge base to facilitate the development of new medical diagnostic assistants. This knowledge base can be expanded and curated by users and serve as a starting point to facilitate new technology development and system improvement in many contexts.
- 27 April 2019
- Published by Springer Nature in BMC Medical Informatics and Decision Making
- Vol. 19 (1) , 1-7
Open AccessAn open access medical knowledge base for community driven diagnostic decision support system development
While early diagnostic decision support systems were built around knowledge bases, more recent systems employ machine learning to consume large amounts of health data. We argue curated knowledge bases will remain an important component of future diagnostic decision support systems by providing ground truth and facilitating explainable human-computer interaction, but that prototype development is hampered by the lack of freely available computable knowledge bases. We constructed an open access knowledge base and evaluated its potential in the context of a prototype decision support system. We developed a modified set-covering algorithm to benchmark the performance of our knowledge base compared to existing platforms. Testing was based on case reports from selected literature and medical student preparatory material. The knowledge base contains over 2000 ICD-10 coded diseases and 450 RX-Norm coded medications, with over 8000 unique observations encoded as SNOMED or LOINC semantic terms. Using 117 medical cases, we found the accuracy of the knowledge base and test algorithm to be comparable to established diagnostic tools such as Isabel and DXplain. Our prototype, as well as DXplain, showed the correct answer as “best suggestion” in 33% of the cases. While we identified shortcomings during development and evaluation, we found the knowledge base to be a promising platform for decision support systems. We built and successfully evaluated an open access knowledge base to facilitate the development of new medical diagnostic assistants. This knowledge base can be expanded and curated by users and serve as a starting point to facilitate new technology development and system improvement in many contexts.
- Open Access
Differentially Private Continual Release of Graph Statistics
Motivated by understanding the dynamics of sensitive social networks over time, we consider the problem of continual release of statistics in a network that arrives online, while preserving privacy of its participants. For our privacy notion, we use differential privacy -- the gold standard in privacy for statistical data analysis. The main challenge in this problem is maintaining a good privacy-utility tradeoff; naive solutions that compose across time, as well as solutions suited to tabular data either lead to poor utility or do not directly apply. In this work, we show that if there is a publicly known upper bound on the maximum degree of any node in the entire network sequence, then we can release many common graph statistics such as degree distributions and subgraph counts continually with a better privacy-accuracy tradeoff. Code available at https://bitbucket.org/shs037/graphprivacycode
Open AccessDifferentially Private Continual Release of Graph Statistics
Motivated by understanding the dynamics of sensitive social networks over time, we consider the problem of continual release of statistics in a network that arrives online, while preserving privacy of its participants. For our privacy notion, we use differential privacy -- the gold standard in privacy for statistical data analysis. The main challenge in this problem is maintaining a good privacy-utility tradeoff; naive solutions that compose across time, as well as solutions suited to tabular data either lead to poor utility or do not directly apply. In this work, we show that if there is a publicly known upper bound on the maximum degree of any node in the entire network sequence, then we can release many common graph statistics such as degree distributions and subgraph counts continually with a better privacy-accuracy tradeoff. Code available at https://bitbucket.org/shs037/graphprivacycode
- 15 August 2018
- Published by Springer Nature
- p. 192-209
A Simple Algorithm for Estimating Distribution Parameters from $n$ n -Dimensional Randomized Binary Responses- 15 August 2018
- Published by Springer Nature
- p. 192-209
A Simple Algorithm for Estimating Distribution Parameters from $n$ n -Dimensional Randomized Binary Responses- Open Access
A Simple Algorithm for Estimating Distribution Parameters from $n$-Dimensional Randomized Binary Responses
Randomized response is attractive for privacy preserving data collection because the provided privacy can be quantified by means such as differential privacy. However, recovering and analyzing statistics involving multiple dependent randomized binary attributes can be difficult, posing a significant barrier to use. In this work, we address this problem by identifying and analyzing a family of response randomizers that change each binary attribute independently with the same probability. Modes of Google's Rappor randomizer as well as applications of two well-known classical randomized response methods, Warner's original method and Simmons' unrelated question method, belong to this family. We show that randomizers in this family transform multinomial distribution parameters by an iterated Kronecker product of an invertible and bisymmetric $2 \times 2$ matrix. This allows us to present a simple and efficient algorithm for obtaining unbiased maximum likelihood parameter estimates for $k$-way marginals from randomized responses and provide theoretical bounds on the statistical efficiency achieved. We also describe the efficiency - differential privacy tradeoff. Importantly, both randomization of responses and the estimation algorithm are simple to implement, an aspect critical to technologies for privacy protection and security.Open AccessA Simple Algorithm for Estimating Distribution Parameters from $n$-Dimensional Randomized Binary Responses
Randomized response is attractive for privacy preserving data collection because the provided privacy can be quantified by means such as differential privacy. However, recovering and analyzing statistics involving multiple dependent randomized binary attributes can be difficult, posing a significant barrier to use. In this work, we address this problem by identifying and analyzing a family of response randomizers that change each binary attribute independently with the same probability. Modes of Google's Rappor randomizer as well as applications of two well-known classical randomized response methods, Warner's original method and Simmons' unrelated question method, belong to this family. We show that randomizers in this family transform multinomial distribution parameters by an iterated Kronecker product of an invertible and bisymmetric $2 \times 2$ matrix. This allows us to present a simple and efficient algorithm for obtaining unbiased maximum likelihood parameter estimates for $k$-way marginals from randomized responses and provide theoretical bounds on the statistical efficiency achieved. We also describe the efficiency - differential privacy tradeoff. Importantly, both randomization of responses and the estimation algorithm are simple to implement, an aspect critical to technologies for privacy protection and security.