Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarsten Baum
Person information
- affiliation (PhD): Aarhus University, Department of Computer Science, Denmark
- affiliation: Technical University of Denmark, Denmark
- affiliation: Bar-Ilan University, Ramat Gan, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i37]Carsten Baum, Jens Berlips, Walther Chen, Hongrui Cui, Ivan Damgård, Jiangbin Dong, Kevin M. Esvelt, Mingyu Gao, Dana Gretton, Leonard Foner, Martin Kysel, Kaiyi Zhang, Juanru Li, Xiang Li, Omer Paneth, Ronald L. Rivest, Francesca Sage-Ling, Adi Shamir, Yue Shen, Meicen Sun, Vinod Vaikuntanathan, Lynn Van Hauwe, Theia Vogel, Benjamin Weinstein-Raun, Yun Wang, Daniel Wichs, Stephen Wooster, Andrew C. Yao, Yu Yu, Haoling Zhang:
A system capable of verifiably and privately screening global DNA synthesis. CoRR abs/2403.14023 (2024)- [i36]Carsten Baum, Ward Beullens, Shibam Mukherjee, Emmanuela Orsini, Sebastian Ramacher, Christian Rechberger, Lawrence Roy, Peter Scholl:
One Tree to Rule Them All: Optimizing GGM Trees and OWFs for Post-Quantum Signatures. IACR Cryptol. ePrint Arch. 2024: 490 (2024) - 2023
- [j2]Carsten Baum
, Samuel Dittmer, Peter Scholl, Xiao Wang:
Sok: vector OLE-based zero-knowledge protocols. Des. Codes Cryptogr. 91(11): 3527-3561 (2023) - [c31]Carsten Baum, James Hsin-yu Chiang, Bernardo David, Tore Kasper Frederiksen:
SoK: Privacy-Enhancing Technologies in Finance. AFT 2023: 12:1-12:30 - [c30]Diego F. Aranha, Carsten Baum, Kristian Gjøsteen, Tjerand Silde:
Verifiable Mix-Nets and Distributed Decryption for Voting from Lattice-Based Assumptions. CCS 2023: 1467-1481 - [c29]Carsten Baum, Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Klooß, Emmanuela Orsini, Lawrence Roy, Peter Scholl:
Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-Head. CRYPTO (5) 2023: 581-615 - [c28]Carsten Baum, James Hsin-yu Chiang, Bernardo David, Tore Kasper Frederiksen:
Eagle: Efficient Privacy Preserving Smart Contracts. FC (1) 2023: 270-288 - [c27]Carsten Baum, Bernardo David, Rafael Dowsley, Ravi Kishore, Jesper Buus Nielsen, Sabine Oechsner:
CRAFT: Composable Randomness Beacons and Output-Independent Abort MPC From Time. Public Key Cryptography (1) 2023: 439-470 - [i35]Carsten Baum, James Hsin-yu Chiang, Bernardo David, Tore Kasper Frederiksen:
SoK: Privacy-Enhancing Technologies in Finance. IACR Cryptol. ePrint Arch. 2023: 122 (2023) - [i34]Carsten Baum, Bernardo David, Elena Pagnin, Akira Takahashi:
CaSCaDE: (Time-Based) Cryptography from Space Communications DElay. IACR Cryptol. ePrint Arch. 2023: 405 (2023) - [i33]Carsten Baum, Samuel Dittmer, Peter Scholl, Xiao Wang:
SoK: Vector OLE-Based Zero-Knowledge Protocols. IACR Cryptol. ePrint Arch. 2023: 857 (2023) - [i32]Carsten Baum, Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Klooß, Emmanuela Orsini, Lawrence Roy, Peter Scholl:
Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures From VOLE-in-the-Head. IACR Cryptol. ePrint Arch. 2023: 996 (2023) - [i31]Carsten Baum, Nikolas Melissaris, Rahul Rachuri, Peter Scholl:
Cheater Identification on a Budget: MPC with Identifiable Abort from Pairwise MACs. IACR Cryptol. ePrint Arch. 2023: 1548 (2023) - 2022
- [j1]Carsten Baum, Daniel Escudero, Alberto Pedrouzo-Ulloa, Peter Scholl, Juan Ramón Troncoso-Pastoriza:
Efficient protocols for oblivious linear function evaluation from ring-LWE. J. Comput. Secur. 30(1): 39-78 (2022) - [c26]Carsten Baum, Robin Jadoul, Emmanuela Orsini, Peter Scholl, Nigel P. Smart:
Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs. CCS 2022: 293-306 - [c25]Carsten Baum, Lennart Braun, Alexander Munch-Hansen, Peter Scholl:
Moz$\mathbb {Z}_{2^k}$arella: Efficient Vector-OLE and Zero-Knowledge Proofs over $\mathbb {Z}_{2^k}$. CRYPTO (4) 2022: 329-358 - [c24]Carsten Baum, James Hsin-yu Chiang, Bernardo David, Tore Kasper Frederiksen, Lorenzo Gentile:
SoK: Mitigation of Front-Running in Decentralized Finance. Financial Cryptography Workshops 2022: 250-271 - [c23]Carsten Baum, Bernardo David, Rafael Dowsley:
(Public) Verifiability for Composable Protocols Without Adaptivity or Zero-Knowledge. ProvSec 2022: 249-272 - [i30]Carsten Baum, Robin Jadoul, Emmanuela Orsini, Peter Scholl, Nigel P. Smart:
Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2022: 82 (2022) - [i29]Diego F. Aranha, Carsten Baum, Kristian Gjøsteen, Tjerand Silde:
Verifiable Mix-Nets and Distributed Decryption for Voting from Lattice-Based Assumptions. IACR Cryptol. ePrint Arch. 2022: 422 (2022) - [i28]Carsten Baum, Lennart Braun, Alexander Munch-Hansen, Peter Scholl:
Mozℤ2karella: Efficient Vector-OLE and Zero-Knowledge Proofs Over ℤ2k. IACR Cryptol. ePrint Arch. 2022: 819 (2022) - [i27]Carsten Baum, James Hsin-yu Chiang, Bernardo David, Tore Kasper Frederiksen:
Eagle: Efficient Privacy Preserving Smart Contracts. IACR Cryptol. ePrint Arch. 2022: 1435 (2022) - 2021
- [c22]Carsten Baum, Bernardo David, Tore Kasper Frederiksen:
P2DEX: Privacy-Preserving Decentralized Cryptocurrency Exchange. ACNS (1) 2021: 163-194 - [c21]Shahar Segal, Yossi Adi, Benny Pinkas, Carsten Baum, Chaya Ganesh, Joseph Keshet:
Fairness in the Eyes of the Data: Certifying Machine-Learning Models. AIES 2021: 926-935 - [c20]Carsten Baum, Lennart Braun, Alexander Munch-Hansen, Benoît Razet, Peter Scholl:
Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and Z2k. CCS 2021: 192-211 - [c19]Carsten Baum, Alex J. Malozemoff, Marc B. Rosen, Peter Scholl:
Mac'n'Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions. CRYPTO (4) 2021: 92-122 - [c18]Diego F. Aranha, Carsten Baum, Kristian Gjøsteen, Tjerand Silde, Thor Tunge:
Lattice-Based Proof of Shuffle and Applications to Electronic Voting. CT-RSA 2021: 227-251 - [c17]Carsten Baum, Bernardo David, Rafael Dowsley, Jesper Buus Nielsen, Sabine Oechsner:
TARDIS: A Foundation of Time-Lock Puzzles in UC. EUROCRYPT (3) 2021: 429-459 - [c16]Carsten Baum, Cyprien Delpech de Saint Guilhem, Daniel Kales, Emmanuela Orsini, Peter Scholl, Greg Zaverucha:
Banquet: Short and Fast Signatures from AES. Public Key Cryptography (1) 2021: 266-297 - [i26]Carsten Baum, Cyprien Delpech de Saint Guilhem, Daniel Kales, Emmanuela Orsini, Peter Scholl, Greg Zaverucha:
Banquet: Short and Fast Signatures from AES. IACR Cryptol. ePrint Arch. 2021: 68 (2021) - [i25]Carsten Baum, Bernardo David, Tore Kasper Frederiksen:
P2DEX: Privacy-Preserving Decentralized Cryptocurrency Exchange. IACR Cryptol. ePrint Arch. 2021: 283 (2021) - [i24]Diego F. Aranha, Carsten Baum, Kristian Gjøsteen, Tjerand Silde, Thor Tunge:
Lattice-Based Proof of Shuffle and Applications to Electronic Voting. IACR Cryptol. ePrint Arch. 2021: 338 (2021) - [i23]Carsten Baum, Lennart Braun, Alexander Munch-Hansen, Peter Scholl:
Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and ℤ2k. IACR Cryptol. ePrint Arch. 2021: 750 (2021) - [i22]Carsten Baum, James Hsin-yu Chiang, Bernardo David, Tore Kasper Frederiksen, Lorenzo Gentile:
SoK: Mitigation of Front-running in Decentralized Finance. IACR Cryptol. ePrint Arch. 2021: 1628 (2021) - 2020
- [c15]Carsten Baum, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez:
Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability. CRYPTO (2) 2020: 562-592 - [c14]Carsten Baum, Tore Kasper Frederiksen, Julia Hesse, Anja Lehmann, Avishay Yanai:
PESTO: Proactively Secure Distributed Single Sign-On, or How to Trust a Hacked Server. EuroS&P 2020: 587-606 - [c13]Carsten Baum, Bernardo David, Rafael Dowsley:
Insured MPC: Efficient Secure Computation with Financial Penalties. Financial Cryptography 2020: 404-420 - [c12]Carsten Baum, Ariel Nof:
Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography. Public Key Cryptography (1) 2020: 495-526 - [c11]Carsten Baum, Daniel Escudero, Alberto Pedrouzo-Ulloa, Peter Scholl, Juan Ramón Troncoso-Pastoriza:
Efficient Protocols for Oblivious Linear Function Evaluation from Ring-LWE. SCN 2020: 130-149 - [i21]Shahar Segal, Yossi Adi, Benny Pinkas, Carsten Baum, Chaya Ganesh, Joseph Keshet:
Fairness in the Eyes of the Data: Certifying Machine-Learning Models. CoRR abs/2009.01534 (2020) - [i20]Carsten Baum, Bernardo David, Rafael Dowsley:
A Framework for Universally Composable Publicly Verifiable Cryptographic Protocols. IACR Cryptol. ePrint Arch. 2020: 207 (2020) - [i19]Carsten Baum, Bernardo David, Rafael Dowsley, Jesper Buus Nielsen, Sabine Oechsner:
TARDIS: Time And Relative Delays In Simulation. IACR Cryptol. ePrint Arch. 2020: 537 (2020) - [i18]Carsten Baum, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez:
Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability. IACR Cryptol. ePrint Arch. 2020: 767 (2020) - [i17]Carsten Baum, Bernardo David, Rafael Dowsley, Ravi Kishore, Jesper Buus Nielsen, Sabine Oechsner:
CRAFT: Composable Randomness and Almost Fairness from Time. IACR Cryptol. ePrint Arch. 2020: 784 (2020) - [i16]Carsten Baum, Daniel Escudero, Alberto Pedrouzo-Ulloa, Peter Scholl, Juan Ramón Troncoso-Pastoriza:
Efficient Protocols for Oblivious Linear Function Evaluation from Ring-LWE. IACR Cryptol. ePrint Arch. 2020: 970 (2020) - [i15]Carsten Baum, Alex J. Malozemoff, Marc B. Rosen, Peter Scholl:
Mac'n'Cheese: Zero-Knowledge Proofs for Arithmetic Circuits with Nested Disjunctions. IACR Cryptol. ePrint Arch. 2020: 1410 (2020)
2010 – 2019
- 2019
- [c10]Carsten Baum, Daniele Cozzo, Nigel P. Smart:
Using TopGear in Overdrive: A More Efficient ZKPoK for SPDZ. SAC 2019: 274-302 - [i14]Carsten Baum, Daniele Cozzo, Nigel P. Smart:
Using TopGear in Overdrive: A more efficient ZKPoK for SPDZ. IACR Cryptol. ePrint Arch. 2019: 35 (2019) - [i13]Carsten Baum, Ariel Nof:
Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography. IACR Cryptol. ePrint Arch. 2019: 532 (2019) - [i12]Carsten Baum, Tore Kasper Frederiksen, Julia Hesse, Anja Lehmann, Avishay Yanai:
PESTO: Proactively Secure Distributed Single Sign-On, or How to Trust a Hacked Server. IACR Cryptol. ePrint Arch. 2019: 1470 (2019) - 2018
- [c9]Carsten Baum, Jonathan Bootle, Andrea Cerulli, Rafaël del Pino, Jens Groth, Vadim Lyubashevsky:
Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits. CRYPTO (2) 2018: 669-699 - [c8]Carsten Baum, Huang Lin, Sabine Oechsner:
Towards Practical Lattice-Based One-Time Linkable Ring Signatures. ICICS 2018: 303-322 - [c7]Carsten Baum, Ivan Damgård, Vadim Lyubashevsky, Sabine Oechsner, Chris Peikert:
More Efficient Commitments from Structured Lattice Assumptions. SCN 2018: 368-385 - [c6]Yossi Adi, Carsten Baum, Moustapha Cissé, Benny Pinkas, Joseph Keshet:
Turning Your Weakness Into a Strength: Watermarking Deep Neural Networks by Backdooring. USENIX Security Symposium 2018: 1615-1631 - [i11]Yossi Adi, Carsten Baum, Moustapha Cissé, Benny Pinkas, Joseph Keshet:
Turning Your Weakness Into a Strength: Watermarking Deep Neural Networks by Backdooring. CoRR abs/1802.04633 (2018) - [i10]Carsten Baum, Huang Lin, Sabine Oechsner:
Towards Practical Lattice-Based One-Time Linkable Ring Signatures. IACR Cryptol. ePrint Arch. 2018: 107 (2018) - [i9]Carsten Baum, Jonathan Bootle, Andrea Cerulli, Rafaël Del Pino, Jens Groth, Vadim Lyubashevsky:
Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits. IACR Cryptol. ePrint Arch. 2018: 560 (2018) - [i8]Carsten Baum, Bernardo David, Rafael Dowsley:
Insured MPC: Efficient Secure Multiparty Computation with Punishable Abort. IACR Cryptol. ePrint Arch. 2018: 942 (2018) - 2017
- [i7]Carsten Baum, Vadim Lyubashevsky:
Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings. IACR Cryptol. ePrint Arch. 2017: 759 (2017) - 2016
- [c5]Carsten Baum, Ivan Damgård, Tomas Toft, Rasmus Winther Zakarias:
Better Preprocessing for Secure Multiparty Computation. ACNS 2016: 327-345 - [c4]Carsten Baum, Ivan Damgård, Kasper Green Larsen, Michael Nielsen:
How to Prove Knowledge of Small Secrets. CRYPTO (3) 2016: 478-498 - [c3]Carsten Baum:
On Garbling Schemes with and Without Privacy. SCN 2016: 468-485 - [c2]Carsten Baum, Emmanuela Orsini, Peter Scholl:
Efficient Secure Multiparty Computation with Identifiable Abort. TCC (B1) 2016: 461-490 - [i6]Carsten Baum, Ivan Damgård, Tomas Toft, Rasmus Winther Zakarias:
Better Preprocessing for Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2016: 48 (2016) - [i5]Carsten Baum:
On Garbling Schemes With And Without Privacy. IACR Cryptol. ePrint Arch. 2016: 150 (2016) - [i4]Carsten Baum, Emmanuela Orsini, Peter Scholl:
Efficient Secure Multiparty Computation with Identifiable Abort. IACR Cryptol. ePrint Arch. 2016: 187 (2016) - [i3]Carsten Baum, Ivan Damgård, Kasper Green Larsen, Michael Nielsen:
How to prove knowledge of small secrets. IACR Cryptol. ePrint Arch. 2016: 538 (2016) - [i2]Carsten Baum, Ivan Damgård, Sabine Oechsner, Chris Peikert:
Efficient Commitments and Zero-Knowledge Protocols from Ring-SIS with Applications to Lattice-based Threshold Cryptosystems. IACR Cryptol. ePrint Arch. 2016: 997 (2016) - 2014
- [c1]Carsten Baum, Ivan Damgård, Claudio Orlandi:
Publicly Auditable Secure Multi-Party Computation. SCN 2014: 175-196 - [i1]Carsten Baum, Ivan Damgård, Claudio Orlandi:
Publicly Auditable Secure Multi-Party Computation. IACR Cryptol. ePrint Arch. 2014: 75 (2014)
Coauthor Index
aka: Bernardo David
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
