default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabrice Benhamouda
Fabrice Ben Hamouda – Fabrice Ben Hamouda-Guichoux
Person information
- affiliation: Amazon AWS, New York, USA
- affiliation (former): IBM Research, Yorktown Heights, NY, USA
- affiliation (PhD 2016): École Normale Supérieure, Paris, France
- affiliation (PhD 2016): PSL Research University, Paris, France
SPARQL queries 
🛈 Please note that only 54% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c40]Fabrice Benhamouda
, Shai Halevi, Hugo Krawczyk, Yiping Ma, Tal Rabin:
SPRINT: High-Throughput Robust Distributed Schnorr Signatures. EUROCRYPT (5) 2024: 62-91- 2023
- [c39]Fabrice Benhamouda, Mariana Raykova, Karn Seth:
Anonymous Counting Tokens. ASIACRYPT (2) 2023: 245-278 - [c38]Fabrice Benhamouda, Shai Halevi, Lev Stambler:
Weighted Secret Sharing from Wiretap Channels. ITC 2023: 8:1-8:19 - [i41]Fabrice Benhamouda, Mariana Raykova, Karn Seth:
Anonymous Counting Tokens. IACR Cryptol. ePrint Arch. 2023: 320 (2023) - [i40]Fabrice Benhamouda, Shai Halevi, Hugo Krawczyk, Tal Rabin, Yiping Ma:
SPRINT: High-Throughput Robust Distributed Schnorr Signatures. IACR Cryptol. ePrint Arch. 2023: 427 (2023) - [i39]Fabrice Benhamouda, Erica Blum, Jonathan Katz, Derek Leung, Julian Loss, Tal Rabin:
Analyzing the Real-World Security of the Algorand Blockchain. IACR Cryptol. ePrint Arch. 2023: 1344 (2023) - 2022
- [j11]Fabrice Benhamouda, Tancrède Lepoint, Julian Loss, Michele Orrù, Mariana Raykova:
On the (in)Security of ROS. J. Cryptol. 35(4): 25 (2022) - [c37]Fabrice Benhamouda, Shai Halevi, Hugo Krawczyk, Alex Miao, Tal Rabin:
Threshold Cryptography as a Service (in the Multiserver and YOSO Models). CCS 2022: 323-336 - [i38]Fabrice Benhamouda, Tancrède Lepoint, Michele Orrù, Mariana Raykova:
Publicly verifiable anonymous tokens with private metadata bit. IACR Cryptol. ePrint Arch. 2022: 4 (2022) - [i37]Fabrice Benhamouda, Shai Halevi, Lev Stambler:
Weighted Secret Sharing from Wiretap Channels. IACR Cryptol. ePrint Arch. 2022: 1578 (2022) - 2021
- [j10]Fabrice Benhamouda, Akshay Degwekar, Yuval Ishai, Tal Rabin:
On the Local Leakage Resilience of Linear Secret Sharing Schemes. J. Cryptol. 34(2): 10 (2021) - [j9]Sameer Wagh, Shruti Tople, Fabrice Benhamouda, Eyal Kushilevitz, Prateek Mittal, Tal Rabin:
Falcon: Honest-Majority Maliciously Secure Framework for Private Deep Learning. Proc. Priv. Enhancing Technol. 2021(1): 188-208 (2021) - [j8]Ghada Almashaqbeh, Fabrice Benhamouda, Seungwook Han, Daniel Jaroslawicz, Tal Malkin, Alex Nicita, Tal Rabin, Abhishek Shah, Eran Tromer:
Gage MPC: Bypassing Residual Function Leakage for Non-Interactive MPC. Proc. Priv. Enhancing Technol. 2021(4): 528-548 (2021) - [c36]Fabrice Benhamouda, Tancrède Lepoint, Julian Loss, Michele Orrù, Mariana Raykova:
On the (in)security of ROS. EUROCRYPT (1) 2021: 33-53 - [c35]Fabrice Benhamouda, Aayush Jain, Ilan Komargodski, Huijia Lin:
Multiparty Reusable Non-interactive Secure Computation from LWE. EUROCRYPT (2) 2021: 724-753 - [c34]Fabrice Benhamouda, Elette Boyle, Niv Gilboa, Shai Halevi, Yuval Ishai, Ariel Nof:
Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation. TCC (2) 2021: 129-161 - [i36]Ghada Almashaqbeh, Fabrice Benhamouda, Seungwook Han, Daniel Jaroslawicz, Tal Malkin, Alex Nicita, Tal Rabin, Abhishek Shah, Eran Tromer:
Gage MPC: Bypassing Residual Function Leakage for Non-Interactive MPC. IACR Cryptol. ePrint Arch. 2021: 256 (2021) - [i35]Fabrice Benhamouda, Aayush Jain, Ilan Komargodski, Huijia Lin:
Multiparty Reusable Non-Interactive Secure Computation from LWE. IACR Cryptol. ePrint Arch. 2021: 378 (2021) - [i34]Fabrice Benhamouda, Elette Boyle, Niv Gilboa, Shai Halevi, Yuval Ishai, Ariel Nof:
Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation. IACR Cryptol. ePrint Arch. 2021: 1223 (2021) - 2020
- [j7]Michel Abdalla, Fabrice Benhamouda, David Pointcheval:
Corrigendum: Public-key encryption indistinguishable under plaintext-checkable attacks. IET Inf. Secur. 14(3): 365-366 (2020) - [c33]Fabrice Benhamouda, Craig Gentry, Sergey Gorbunov, Shai Halevi, Hugo Krawczyk, Chengyu Lin, Tal Rabin, Leonid Reyzin:
Can a Public Blockchain Keep a Secret? TCC (1) 2020: 260-290 - [c32]Fabrice Benhamouda, Huijia Lin:
Mr NISC: Multiparty Reusable Non-Interactive Secure Computation. TCC (2) 2020: 349-378 - [i33]Sameer Wagh, Shruti Tople, Fabrice Benhamouda, Eyal Kushilevitz, Prateek Mittal, Tal Rabin:
FALCON: Honest-Majority Maliciously Secure Framework for Private Deep Learning. CoRR abs/2004.02229 (2020) - [i32]Fabrice Benhamouda, Huijia Lin:
Multiparty Reusable Non-Interactive Secure Computation. IACR Cryptol. ePrint Arch. 2020: 221 (2020) - [i31]Fabrice Benhamouda, Craig Gentry, Sergey Gorbunov, Shai Halevi, Hugo Krawczyk, Chengyu Lin, Tal Rabin, Leonid Reyzin:
Can a Blockchain Keep a Secret? IACR Cryptol. ePrint Arch. 2020: 464 (2020) - [i30]Fabrice Benhamouda, Tancrède Lepoint, Michele Orrù, Mariana Raykova:
On the (in)security of ROS. IACR Cryptol. ePrint Arch. 2020: 945 (2020)
2010 – 2019
- 2019
- [j6]Fabrice Benhamouda, Shai Halevi, Tzipora Halevi:
Supporting private data on Hyperledger Fabric with secure multiparty computation. IBM J. Res. Dev. 63(2/3): 3:1-3:8 (2019) - [j5]Michel Abdalla, Fabrice Benhamouda, David Pointcheval:
On the Tightness of Forward-Secure Signature Reductions. J. Cryptol. 32(1): 84-150 (2019) - [c31]Michel Abdalla, Fabrice Benhamouda, Alain Passelègue:
Algebraic XOR-RKA-Secure Pseudorandom Functions from Post-Zeroizing Multilinear Maps. ASIACRYPT (2) 2019: 386-412 - [c30]Michel Abdalla, Fabrice Benhamouda, Romain Gay:
From Single-Input to Multi-client Inner-Product Functional Encryption. ASIACRYPT (3) 2019: 552-582 - [c29]Tzipora Halevi, Fabrice Benhamouda, Angelo De Caro, Shai Halevi, Charanjit S. Jutla, Yacov Manevich, Qi Zhang:
Initial Public Offering (IPO) on Permissioned Blockchain Using Secure Multiparty Computation. Blockchain 2019: 91-98 - [c28]Michel Abdalla, Fabrice Benhamouda, Markulf Kohlweiss, Hendrik Waldner:
Decentralizing Inner-Product Functional Encryption. Public Key Cryptography (2) 2019: 128-157 - [i29]Michel Abdalla, Fabrice Benhamouda, Markulf Kohlweiss, Hendrik Waldner:
Decentralizing Inner-Product Functional Encryption. IACR Cryptol. ePrint Arch. 2019: 20 (2019) - [i28]Michel Abdalla, Fabrice Benhamouda, Romain Gay:
From Single-Input to Multi-Client Inner-Product Functional Encryption. IACR Cryptol. ePrint Arch. 2019: 487 (2019) - [i27]Fabrice Benhamouda, Akshay Degwekar, Yuval Ishai, Tal Rabin:
On the Local Leakage Resilience of Linear Secret Sharing Schemes. IACR Cryptol. ePrint Arch. 2019: 653 (2019) - 2018
- [j4]Michel Abdalla, Fabrice Benhamouda, Alain Passelègue, Kenneth G. Paterson:
Related-Key Security for Pseudorandom Functions Beyond the Linear Barrier. J. Cryptol. 31(4): 917-964 (2018) - [c27]Fabrice Benhamouda, Akshay Degwekar, Yuval Ishai, Tal Rabin:
On the Local Leakage Resilience of Linear Secret Sharing Schemes. CRYPTO (1) 2018: 531-561 - [c26]Fabrice Benhamouda, Huijia Lin:
k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits. EUROCRYPT (2) 2018: 500-532 - [c25]Fabrice Benhamouda, Shai Halevi, Tzipora Halevi:
Supporting Private Data on Hyperledger Fabric with Secure Multiparty Computation. IC2E 2018: 357-363 - [c24]Fabrice Benhamouda, Olivier Blazy, Léo Ducas, Willy Quach:
Hash Proof Systems over Lattices Revisited. Public Key Cryptography (2) 2018: 644-674 - [c23]Fabrice Benhamouda, Huijia Lin, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam:
Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions. TCC (1) 2018: 175-205 - [i26]Fabrice Benhamouda, Marc Joye:
How to Profile Privacy-Conscious Users in Recommender Systems. CoRR abs/1812.00125 (2018) - 2017
- [j3]Fabrice Benhamouda, Javier Herranz, Marc Joye, Benoît Libert:
Efficient Cryptosystems From 2k-th Power Residue Symbols. J. Cryptol. 30(2): 519-549 (2017) - [c22]Fabrice Benhamouda, Hugo Krawczyk, Tal Rabin:
Robust Non-interactive Multiparty Computation Against Constant-Size Collusion. CRYPTO (1) 2017: 391-419 - [c21]Sonia Belaïd, Fabrice Benhamouda, Alain Passelègue, Emmanuel Prouff, Adrian Thillard, Damien Vergnaud:
Private Multiplication over Finite Fields. CRYPTO (3) 2017: 397-426 - [c20]Fabrice Benhamouda, Houda Ferradi, Rémi Géraud, David Naccache:
Non-interactive Provably Secure Attestations for Arbitrary RSA Prime Generation Algorithms. ESORICS (1) 2017: 206-223 - [c19]Fabrice Benhamouda, Florian Bourse, Helger Lipmaa:
CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions. Public Key Cryptography (2) 2017: 36-66 - [c18]Michel Abdalla, Fabrice Benhamouda, David Pointcheval:
Removing Erasures with Explainable Hash Proof Systems. Public Key Cryptography (1) 2017: 151-174 - [c17]Fabrice Benhamouda, Tancrède Lepoint, Claire Mathieu, Hang Zhou:
Optimization of Bootstrapping in Circuits. SODA 2017: 2423-2433 - [i25]Fabrice Benhamouda, Florian Bourse, Helger Lipmaa:
CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions. IACR Cryptol. ePrint Arch. 2017: 38 (2017) - [i24]Michel Abdalla, Fabrice Benhamouda, Alain Passelègue:
Algebraic XOR-RKA-Secure Pseudorandom Functions from Post-Zeroizing Multilinear Maps. IACR Cryptol. ePrint Arch. 2017: 500 (2017) - [i23]Fabrice Benhamouda, Hugo Krawczyk, Tal Rabin:
Robust Non-Interactive Multiparty Computation Against Constant-Size Collusion. IACR Cryptol. ePrint Arch. 2017: 555 (2017) - [i22]Fabrice Benhamouda, Houda Ferradi, Rémi Géraud, David Naccache:
Non-Interactive Provably Secure Attestations for Arbitrary RSA Prime Generation Algorithms. IACR Cryptol. ePrint Arch. 2017: 640 (2017) - [i21]Michel Abdalla, Fabrice Benhamouda, David Pointcheval:
On the Tightness of Forward-Secure Signature Reductions. IACR Cryptol. ePrint Arch. 2017: 746 (2017) - [i20]Fabrice Benhamouda, Olivier Blazy, Léo Ducas, Willy Quach:
Hash Proof Systems over Lattices Revisited. IACR Cryptol. ePrint Arch. 2017: 997 (2017) - [i19]Fabrice Benhamouda, Huijia Lin:
k-Round MPC from k-Round OT via Garbled Interactive Circuits. IACR Cryptol. ePrint Arch. 2017: 1125 (2017) - 2016
- [b1]Fabrice Ben Hamouda-Guichoux:
Diverse modules and zero-knowledge. École Normale Supérieure, Paris, France, 2016 - [j2]Michel Abdalla, Fabrice Benhamouda, David Pointcheval:
Public-key encryption indistinguishable under plaintext-checkable attacks. IET Inf. Secur. 10(6): 288-303 (2016) - [j1]Fabrice Benhamouda, Marc Joye, Benoît Libert:
A New Framework for Privacy-Preserving Aggregation of Time-Series Data. ACM Trans. Inf. Syst. Secur. 18(3): 10:1-10:21 (2016) - [c16]Sonia Belaïd, Fabrice Benhamouda, Alain Passelègue, Emmanuel Prouff, Adrian Thillard, Damien Vergnaud:
Randomness Complexity of Private Circuits for Multiplication. EUROCRYPT (2) 2016: 616-648 - [c15]Fabrice Benhamouda, Céline Chevalier, Adrian Thillard, Damien Vergnaud:
Easing Coppersmith Methods Using Analytic Combinatorics: Applications to Public-Key Cryptography with Weak Pseudorandomness. Public Key Cryptography (2) 2016: 36-66 - [i18]Fabrice Benhamouda, Tancrède Lepoint, Claire Mathieu, Hang Zhou:
Optimization of Bootstrapping in Circuits. CoRR abs/1608.04535 (2016) - [i17]Fabrice Benhamouda, Céline Chevalier, Adrian Thillard, Damien Vergnaud:
Easing Coppersmith Methods using Analytic Combinatorics: Applications to Public-Key Cryptography with Weak Pseudorandomness. IACR Cryptol. ePrint Arch. 2016: 7 (2016) - [i16]Sonia Belaïd, Fabrice Benhamouda, Alain Passelègue, Emmanuel Prouff, Adrian Thillard, Damien Vergnaud:
Randomness Complexity of Private Circuits for Multiplication. IACR Cryptol. ePrint Arch. 2016: 211 (2016) - [i15]Fabrice Benhamouda, Tancrède Lepoint, Claire Mathieu, Hang Zhou:
Optimization of Bootstrapping in Circuits. IACR Cryptol. ePrint Arch. 2016: 785 (2016) - 2015
- [c14]Michel Abdalla, Fabrice Benhamouda, Alain Passelègue:
Multilinear and Aggregate Pseudorandom Functions: New Constructions and Improved Security. ASIACRYPT (1) 2015: 103-120 - [c13]Fabrice Benhamouda, Geoffroy Couteau, David Pointcheval, Hoeteck Wee:
Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting. CRYPTO (2) 2015: 107-129 - [c12]Michel Abdalla, Fabrice Benhamouda, Alain Passelègue:
An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security. CRYPTO (1) 2015: 388-409 - [c11]Fabrice Benhamouda, Stephan Krenn, Vadim Lyubashevsky, Krzysztof Pietrzak:
Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings. ESORICS (1) 2015: 305-325 - [c10]Michel Abdalla, Fabrice Benhamouda, David Pointcheval:
Disjunctions for Hash Proof Systems: New Constructions and Applications. EUROCRYPT (2) 2015: 69-100 - [c9]Michel Abdalla, Fabrice Benhamouda, David Pointcheval:
Public-Key Encryption Indistinguishable Under Plaintext-Checkable Attacks. Public Key Cryptography 2015: 332-352 - [c8]Michel Abdalla, Fabrice Benhamouda, Philip MacKenzie:
Security of the J-PAKE Password-Authenticated Key Exchange Protocol. IEEE Symposium on Security and Privacy 2015: 571-587 - [i14]Fabrice Benhamouda, Olivier Blazy, Céline Chevalier, David Pointcheval, Damien Vergnaud:
New Techniques for SPHFs and Efficient One-Round PAKE Protocols. IACR Cryptol. ePrint Arch. 2015: 188 (2015) - [i13]Michel Abdalla, Fabrice Benhamouda, David Pointcheval:
Tighter Reductions for Forward-Secure Signature Schemes. IACR Cryptol. ePrint Arch. 2015: 196 (2015) - [i12]Fabrice Benhamouda, Geoffroy Couteau, David Pointcheval, Hoeteck Wee:
Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting. IACR Cryptol. ePrint Arch. 2015: 246 (2015) - [i11]Michel Abdalla, Fabrice Benhamouda, Alain Passelègue:
An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security. IACR Cryptol. ePrint Arch. 2015: 554 (2015) - [i10]Michel Abdalla, Fabrice Benhamouda, Alain Passelègue:
Multilinear and Aggregate Pseudorandom Functions: New Constructions and Improved Security. IACR Cryptol. ePrint Arch. 2015: 867 (2015) - 2014
- [c7]Fabrice Benhamouda, Jan Camenisch, Stephan Krenn, Vadim Lyubashevsky, Gregory Neven:
Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures. ASIACRYPT (1) 2014: 551-572 - [c6]Michel Abdalla, Fabrice Benhamouda, Alain Passelègue, Kenneth G. Paterson:
Related-Key Security for Pseudorandom Functions Beyond the Linear Barrier. CRYPTO (1) 2014: 77-94 - [i9]Michel Abdalla, Fabrice Benhamouda, David Pointcheval:
Removing Erasures with Explainable Hash Proof Systems. IACR Cryptol. ePrint Arch. 2014: 125 (2014) - [i8]Michel Abdalla, Fabrice Benhamouda, David Pointcheval:
Disjunctions for Hash Proof Systems: New Constructions and Applications. IACR Cryptol. ePrint Arch. 2014: 483 (2014) - [i7]Michel Abdalla, Fabrice Benhamouda, Alain Passelègue, Kenneth G. Paterson:
Related-Key Security for Pseudorandom Functions Beyond the Linear Barrier. IACR Cryptol. ePrint Arch. 2014: 488 (2014) - [i6]Michel Abdalla, Fabrice Benhamouda, David Pointcheval:
SPOKE: Simple Password-Only Key Exchange in the Standard Model. IACR Cryptol. ePrint Arch. 2014: 609 (2014) - [i5]Fabrice Benhamouda, Stephan Krenn, Vadim Lyubashevsky, Krzysztof Pietrzak:
Efficient Zero-Knowledge Proofs for Commitments from Learning With Errors over Rings. IACR Cryptol. ePrint Arch. 2014: 889 (2014) - 2013
- [c5]Michel Abdalla, Fabrice Benhamouda, Olivier Blazy, Céline Chevalier, David Pointcheval:
SPHF-Friendly Non-interactive Commitments. ASIACRYPT (1) 2013: 214-234 - [c4]Fabrice Benhamouda, Olivier Blazy, Céline Chevalier, David Pointcheval, Damien Vergnaud:
New Techniques for SPHFs and Efficient One-Round PAKE Protocols. CRYPTO (1) 2013: 449-475 - [c3]Fabrice Ben Hamouda, Olivier Blazy, Céline Chevalier, David Pointcheval, Damien Vergnaud:
Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages. Public Key Cryptography 2013: 272-291 - [c2]Michel Abdalla, Fabrice Ben Hamouda, David Pointcheval:
Tighter Reductions for Forward-Secure Signature Schemes. Public Key Cryptography 2013: 292-311 - [i4]Fabrice Ben Hamouda, Olivier Blazy, Céline Chevalier, David Pointcheval, Damien Vergnaud:
New Smooth Projective Hash Functions and One-Round Authenticated Key Exchange. IACR Cryptol. ePrint Arch. 2013: 34 (2013) - [i3]Fabrice Ben Hamouda, David Pointcheval:
Trapdoor Smooth Projective Hash Functions. IACR Cryptol. ePrint Arch. 2013: 341 (2013) - [i2]Michel Abdalla, Fabrice Benhamouda, Olivier Blazy, Céline Chevalier, David Pointcheval:
SPHF-Friendly Non-Interactive Commitments. IACR Cryptol. ePrint Arch. 2013: 588 (2013) - [i1]Fabrice Benhamouda, David Pointcheval:
Verifier-Based Password-Authenticated Key Exchange: New Models and Constructions. IACR Cryptol. ePrint Arch. 2013: 833 (2013) - 2012
- [c1]Antoine Amarilli, Fabrice Ben Hamouda, Florian Bourse, Robin Morisset, David Naccache, Pablo Rauzy:
From Rational Number Reconstruction to Set Reconciliation and File Synchronization. TGC 2012: 1-18
Coauthor Index
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-12-10 20:44 CET 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:
