default search action
Vadim Lyubashevsky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c56]Vadim Lyubashevsky, Gregor Seiler, Patrick Steuer:
The LaZer Library: Lattice-Based Zero Knowledge and Succinct Proofs for Quantum-Safe Privacy. CCS 2024: 3125-3137 - [i51]Vadim Lyubashevsky:
Basic Lattice Cryptography: The concepts behind Kyber (ML-KEM) and Dilithium (ML-DSA). IACR Cryptol. ePrint Arch. 2024: 1287 (2024) - [i50]Vadim Lyubashevsky, Gregor Seiler, Patrick Steuer:
The LaZer Library: Lattice-Based Zero Knowledge and Succinct Proofs for Quantum-Safe Privacy. IACR Cryptol. ePrint Arch. 2024: 1846 (2024) - 2023
- [c55]Ward Beullens
, Vadim Lyubashevsky
Lattice-Based Blind Signatures: Short, Efficient, and Round-Optimal. CCS 2023: 16-29 - [c54]Jonathan Bootle
A Framework for Practical Anonymous Credentials from Lattices. CRYPTO (2) 2023: 384-417 - [c53]Julien Duman
A Thorough Treatment of Highly-Efficient NTRU Instantiations. Public Key Cryptography (1) 2023: 65-94 - [i49]Ward Beullens, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler:
Lattice-Based Blind Signatures: Short, Efficient, and Round-Optimal. IACR Cryptol. ePrint Arch. 2023: 77 (2023) - [i48]Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Alessandro Sorniotti:
A Framework for Practical Anonymous Credentials from Lattices. IACR Cryptol. ePrint Arch. 2023: 560 (2023) - 2022
- [c52]Vadim Lyubashevsky, Ngoc Khanh Nguyen
BLOOM: Bimodal Lattice One-out-of-Many Proofs and Applications. ASIACRYPT (4) 2022: 95-125 - [c51]Vadim Lyubashevsky, Ngoc Khanh Nguyen
Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General. CRYPTO (2) 2022: 71-101 - [c50]Craig Gentry, Shai Halevi, Vadim Lyubashevsky:
Practical Non-interactive Publicly Verifiable Secret Sharing with Thousands of Parties. EUROCRYPT (1) 2022: 458-487 - [c49]Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon:
Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures. Public Key Cryptography (2) 2022: 498-527 - [i47]Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon:
Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures. IACR Cryptol. ePrint Arch. 2022: 6 (2022) - [i46]Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon:
Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General. IACR Cryptol. ePrint Arch. 2022: 284 (2022) - [i45]Vadim Lyubashevsky, Ngoc Khanh Nguyen:
BLOOM: Bimodal Lattice One-Out-of-Many Proofs and Applications. IACR Cryptol. ePrint Arch. 2022: 1307 (2022) - 2021
- [c48]Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon, Gregor Seiler:
Shorter Lattice-Based Group Signatures via "Almost Free" Encryption and Other Optimizations. ASIACRYPT (4) 2021: 218-248 - [c47]Julien Duman, Kathrin Hövelmanns, Eike Kiltz
Faster Lattice-Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing. CCS 2021: 2722-2737 - [c46]Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler:
SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions. CRYPTO (2) 2021: 611-640 - [c45]Jonathan Bootle
More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE. ESORICS (2) 2021: 608-627 - [c44]Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler:
Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments. Public Key Cryptography (1) 2021: 215-241 - [i44]Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler:
SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions. IACR Cryptol. ePrint Arch. 2021: 564 (2021) - [i43]Julien Duman, Eike Kiltz, Kathrin Hövelmanns, Vadim Lyubashevsky, Gregor Seiler:
Faster Lattice-Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing. IACR Cryptol. ePrint Arch. 2021: 1351 (2021) - [i42]Julien Duman, Kathrin Hövelmanns, Eike Kiltz, Vadim Lyubashevsky, Gregor Seiler, Dominique Unruh:
A Thorough Treatment of Highly-Efficient NTRU Instantiations. IACR Cryptol. ePrint Arch. 2021: 1352 (2021) - [i41]Vadim Lyubashevsky, Damien Stehlé:
Non-applicability of the Gaborit&Aguilar-Melchor patent to Kyber and Saber. IACR Cryptol. ePrint Arch. 2021: 1364 (2021) - [i40]Craig Gentry, Shai Halevi, Vadim Lyubashevsky:
Practical Non-interactive Publicly Verifiable Secret Sharing with Thousands of Parties. IACR Cryptol. ePrint Arch. 2021: 1397 (2021) - [i39]Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon, Gregor Seiler:
Shorter Lattice-Based Group Signatures via "Almost Free" Encryption and Other Optimizations. IACR Cryptol. ePrint Arch. 2021: 1575 (2021) - 2020
- [c43]Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler:
Practical Lattice-Based Zero-Knowledge Proofs for Integer Relations. CCS 2020: 1051-1070 - [c42]Jonathan Bootle
A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge. CRYPTO (2) 2020: 441-469 - [c41]Thomas Attema
Practical Product Proofs for Lattice Commitments. CRYPTO (2) 2020: 470-499 - [c40]Jonathan Bootle
Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions. PQCrypto 2020: 226-246 - [i38]Thomas Attema, Vadim Lyubashevsky, Gregor Seiler:
Practical Product Proofs for Lattice Commitments. IACR Cryptol. ePrint Arch. 2020: 517 (2020) - [i37]Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler:
A non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge. IACR Cryptol. ePrint Arch. 2020: 737 (2020) - [i36]Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler:
Practical Lattice-Based Zero-Knowledge Proofs for Integer Relations. IACR Cryptol. ePrint Arch. 2020: 1183 (2020) - [i35]Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler:
Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments. IACR Cryptol. ePrint Arch. 2020: 1448 (2020) - [i34]Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler:
More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE. IACR Cryptol. ePrint Arch. 2020: 1449 (2020)
2010 – 2019
- 2019
- [j7]Vadim Lyubashevsky, Gregor Seiler:
NTTRU: Truly Fast NTRU Using NTT. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2019(3): 180-201 (2019) - [c39]Liqun Chen
A Framework for Efficient Lattice-Based DAA. CYSARM@CCS 2019: 23-34 - [c38]Jonathan Bootle
Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs. CRYPTO (1) 2019: 176-202 - [c37]Zvika Brakerski, Vadim Lyubashevsky, Vinod Vaikuntanathan, Daniel Wichs:
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing. EUROCRYPT (3) 2019: 619-635 - [c36]Rafaël del Pino, Vadim Lyubashevsky, Gregor Seiler:
Short Discrete Log Proofs for FHE and Ring-LWE Ciphertexts. Public Key Cryptography (1) 2019: 344-373 - [i33]Vadim Lyubashevsky, Gregor Seiler:
NTTRU: Truly Fast NTRU Using NTT. IACR Cryptol. ePrint Arch. 2019: 40 (2019) - [i32]Rafaël del Pino, Vadim Lyubashevsky, Gregor Seiler:
Short Discrete Log Proofs for FHE and Ring-LWE Ciphertexts. IACR Cryptol. ePrint Arch. 2019: 57 (2019) - [i31]Jonathan Bootle, Vadim Lyubashevsky, Gregor Seiler:
Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2019: 642 (2019) - 2018
- [j6]Vadim Lyubashevsky, Daniele Micciancio
Asymptotically Efficient Lattice-Based Digital Signatures. J. Cryptol. 31(3): 774-797 (2018) - [j5]Léo Ducas, Eike Kiltz
CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2018(1): 238-268 (2018) - [c35]Rafaël del Pino, Vadim Lyubashevsky, Gregor Seiler:
Lattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism Stability. CCS 2018: 574-591 - [c34]Carsten Baum, Jonathan Bootle
Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits. CRYPTO (2) 2018: 669-699 - [c33]Vadim Lyubashevsky, Gregor Seiler:
Short, Invertible Elements in Partially Splitting Cyclotomic Rings and Applications to Lattice-Based Zero-Knowledge Proofs. EUROCRYPT (1) 2018: 204-224 - [c32]Eike Kiltz
A Concrete Treatment of Fiat-Shamir Signatures in the Quantum Random-Oracle Model. EUROCRYPT (3) 2018: 552-586 - [c31]Joppe W. Bos, Léo Ducas, Eike Kiltz
CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM. EuroS&P 2018: 353-367 - [c30]Carsten Baum, Ivan Damgård, Vadim Lyubashevsky, Sabine Oechsner
More Efficient Commitments from Structured Lattice Assumptions. SCN 2018: 368-385 - [i30]Zvika Brakerski, Vadim Lyubashevsky, Vinod Vaikuntanathan, Daniel Wichs:
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing. Electron. Colloquium Comput. Complex. TR18 (2018) - [i29]Zvika Brakerski, Vadim Lyubashevsky, Vinod Vaikuntanathan, Daniel Wichs:
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing. IACR Cryptol. ePrint Arch. 2018: 279 (2018) - [i28]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) - [i27]Rafaël Del Pino, Vadim Lyubashevsky, Gregor Seiler:
Lattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism Stability. IACR Cryptol. ePrint Arch. 2018: 779 (2018) - 2017
- [c29]Rafaël del Pino, Vadim Lyubashevsky, Gregory Neven, Gregor Seiler:
Practical Quantum-Safe Voting from Lattices. CCS 2017: 1565-1581 - [c28]Rafaël del Pino, Vadim Lyubashevsky:
Amortization with Fewer Equations for Proving Knowledge of Small Secrets. CRYPTO (3) 2017: 365-394 - [c27]Vadim Lyubashevsky, Gregory Neven:
One-Shot Verifiable Encryption from Lattices. EUROCRYPT (1) 2017: 293-323 - [i26]Vadim Lyubashevsky, Gregory Neven:
One-Shot Verifiable Encryption from Lattices. IACR Cryptol. ePrint Arch. 2017: 122 (2017) - [i25]Rafaël Del Pino, Vadim Lyubashevsky:
Amortization with Fewer Equations for Proving Knowledge of Small Secrets. IACR Cryptol. ePrint Arch. 2017: 280 (2017) - [i24]Vadim Lyubashevsky, Gregor Seiler:
Partially Splitting Rings for Faster Lattice-Based Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2017: 523 (2017) - [i23]Léo Ducas, Tancrède Lepoint, Vadim Lyubashevsky, Peter Schwabe, Gregor Seiler, Damien Stehlé:
CRYSTALS - Dilithium: Digital Signatures from Module Lattices. IACR Cryptol. ePrint Arch. 2017: 633 (2017) - [i22]Joppe W. Bos, Léo Ducas, Eike Kiltz, Tancrède Lepoint, Vadim Lyubashevsky, John M. Schanck, Peter Schwabe, Damien Stehlé:
CRYSTALS - Kyber: a CCA-secure module-lattice-based KEM. IACR Cryptol. ePrint Arch. 2017: 634 (2017) - [i21]Carsten Baum, Vadim Lyubashevsky:
Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings. IACR Cryptol. ePrint Arch. 2017: 759 (2017) - [i20]Eike Kiltz, Vadim Lyubashevsky, Christian Schaffner:
A Concrete Treatment of Fiat-Shamir Signatures in the Quantum Random-Oracle Model. IACR Cryptol. ePrint Arch. 2017: 916 (2017) - [i19]Rafaël del Pino, Vadim Lyubashevsky, Gregory Neven, Gregor Seiler:
Practical Quantum-Safe Voting from Lattices. IACR Cryptol. ePrint Arch. 2017: 1235 (2017) - 2016
- [j4]Michel Abdalla
Tightly Secure Signatures From Lossy Identification Schemes. J. Cryptol. 29(3): 597-631 (2016) - [c26]Vadim Lyubashevsky:
Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings. ASIACRYPT (2) 2016: 196-214 - [c25]Rafaël del Pino, Vadim Lyubashevsky, David Pointcheval:
The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs. SCN 2016: 273-291 - [i18]Rafaël Del Pino, Vadim Lyubashevsky, David Pointcheval:
The Whole is Less than the Sum of its Parts: Constructing More Efficient Lattice-Based AKEs. IACR Cryptol. ePrint Arch. 2016: 435 (2016) - [i17]Vadim Lyubashevsky:
Digital Signatures Based on the Hardness of Ideal Lattice Problems in all Rings. IACR Cryptol. ePrint Arch. 2016: 796 (2016) - 2015
- [j3]Tim Güneysu
Lattice-Based Signatures: Optimization and Implementation on Reconfigurable Hardware. IEEE Trans. Computers 64(7): 1954-1967 (2015) - [c24]Fabrice Benhamouda
Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings. ESORICS (1) 2015: 305-325 - [c23]Vadim Lyubashevsky, Thomas Prest
Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices. EUROCRYPT (1) 2015: 789-815 - [c22]Vadim Lyubashevsky, Daniel Wichs:
Simple Lattice Trapdoor Sampling from a Broad Class of Distributions. Public Key Cryptography 2015: 716-730 - [i16]Vadim Lyubashevsky, Thomas Prest:
Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices. IACR Cryptol. ePrint Arch. 2015: 257 (2015) - 2014
- [c21]Léo Ducas, Vadim Lyubashevsky, Thomas Prest
Efficient Identity-Based Encryption over NTRU Lattices. ASIACRYPT (2) 2014: 22-41 - [c20]Fabrice Benhamouda
Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures. ASIACRYPT (1) 2014: 551-572 - [i15]Léo Ducas, Vadim Lyubashevsky, Thomas Prest:
E fficient Identity-Based Encryption over NTRU Lattices. IACR Cryptol. ePrint Arch. 2014: 794 (2014) - [i14]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) - [i13]Vadim Lyubashevsky, Daniel Wichs:
Simple Lattice Trapdoor Sampling from a Broad Class of Distributions. IACR Cryptol. ePrint Arch. 2014: 1027 (2014) - 2013
- [j2]Vadim Lyubashevsky, Chris Peikert, Oded Regev:
On Ideal Lattices and Learning with Errors over Rings. J. ACM 60(6): 43:1-43:35 (2013) - [c19]Léo Ducas, Alain Durmus, Tancrède Lepoint
Lattice Signatures and Bimodal Gaussians. CRYPTO (1) 2013: 40-56 - [c18]Vadim Lyubashevsky, Daniel Masny:
Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs. CRYPTO (2) 2013: 308-325 - [c17]Vadim Lyubashevsky, Chris Peikert, Oded Regev:
A Toolkit for Ring-LWE Cryptography. EUROCRYPT 2013: 35-54 - [i12]Vadim Lyubashevsky, Daniel Masny:
Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs. IACR Cryptol. ePrint Arch. 2013: 92 (2013) - [i11]Vadim Lyubashevsky, Chris Peikert, Oded Regev:
A Toolkit for Ring-LWE Cryptography. IACR Cryptol. ePrint Arch. 2013: 293 (2013) - [i10]Léo Ducas, Alain Durmus, Tancrède Lepoint, Vadim Lyubashevsky:
Lattice Signatures and Bimodal Gaussians. IACR Cryptol. ePrint Arch. 2013: 383 (2013) - [i9]Vadim Lyubashevsky, Daniele Micciancio:
Asymptotically Effi cient Lattice-Based Digital Signatures. IACR Cryptol. ePrint Arch. 2013: 746 (2013) - [i8]Michel Abdalla, Pierre-Alain Fouque, Vadim Lyubashevsky, Mehdi Tibouchi:
Tightly-Secure Signatures From Lossy Identification Schemes. IACR Cryptol. ePrint Arch. 2013: 856 (2013) - 2012
- [c16]Tim Güneysu
Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems. CHES 2012: 530-547 - [c15]Michel Abdalla
Tightly-Secure Signatures from Lossy Identification Schemes. EUROCRYPT 2012: 572-590 - [c14]Vadim Lyubashevsky:
Lattice Signatures without Trapdoors. EUROCRYPT 2012: 738-755 - [c13]Stefan Heyse, Eike Kiltz
Lapin: An Efficient Authentication Protocol Based on Ring-LPN. FSE 2012: 346-365 - [c12]Michel Abdalla
From Selective to Full Security: Semi-generic Transformations in the Standard Model. Public Key Cryptography 2012: 316-333 - [i7]Vadim Lyubashevsky, Chris Peikert, Oded Regev:
On Ideal Lattices and Learning with Errors Over Rings. IACR Cryptol. ePrint Arch. 2012: 230 (2012) - [i6]Michel Abdalla, Dario Fiore, Vadim Lyubashevsky:
From Selective to Full Security: Semi-Generic Transformations in the Standard Model. IACR Cryptol. ePrint Arch. 2012: 341 (2012) - 2011
- [c11]Vadim Lyubashevsky:
Search to decision reduction for the learning with errors over rings problem. ITW 2011: 410-414 - [i5]Vadim Lyubashevsky:
Lattice Signatures Without Trapdoors. IACR Cryptol. ePrint Arch. 2011: 537 (2011) - 2010
- [c10]Vadim Lyubashevsky, Chris Peikert, Oded Regev:
On Ideal Lattices and Learning with Errors over Rings. EUROCRYPT 2010: 1-23 - [c9]Vadim Lyubashevsky, Adriana Palacio, Gil Segev:
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum. TCC 2010: 382-400
2000 – 2009
- 2009
- [j1]Ishay Haviv, Vadim Lyubashevsky, Oded Regev:
A Note on the Distribution of the Distance from a Lattice. Discret. Comput. Geom. 41(1): 162-176 (2009) - [c8]Vadim Lyubashevsky:
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures. ASIACRYPT 2009: 598-616 - [c7]Vadim Lyubashevsky, Daniele Micciancio
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem. CRYPTO 2009: 577-594 - [i4]Vadim Lyubashevsky, Adriana Palacio, Gil Segev:
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum. IACR Cryptol. ePrint Arch. 2009: 576 (2009) - 2008
- [b1]Vadim Lyubashevsky:
Towards practical lattice-based cryptography. University of California, San Diego, USA, 2008 - [c6]Vadim Lyubashevsky, Daniele Micciancio
SWIFFT: A Modest Proposal for FFT Hashing. FSE 2008: 54-72 - [c5]Vadim Lyubashevsky:
Lattice-Based Identification Schemes Secure Under Active Attacks. Public Key Cryptography 2008: 162-179 - [c4]Vadim Lyubashevsky, Daniele Micciancio
Asymptotically Efficient Lattice-Based Digital Signatures. TCC 2008: 37-54 - [i3]Vadim Lyubashevsky:
The nc-Unique Shortest Vector Problem is Hard. IACR Cryptol. ePrint Arch. 2008: 504 (2008) - 2006
- [c3]Yi-Kai Liu, Vadim Lyubashevsky, Daniele Micciancio
On Bounded Distance Decoding for General Lattices. APPROX-RANDOM 2006: 450-461 - [c2]Vadim Lyubashevsky, Daniele Micciancio
Generalized Compact Knapsacks Are Collision Resistant. ICALP (2) 2006: 144-155 - 2005
- [c1]Vadim Lyubashevsky:
The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem. APPROX-RANDOM 2005: 378-389 - [i2]Vadim Lyubashevsky:
On Random High Density Subset Sums. Electron. Colloquium Comput. Complex. TR05 (2005) - [i1]Vadim Lyubashevsky, Daniele Micciancio:
Generalized Compact Knapsacks are Collision Resistant. Electron. Colloquium Comput. Complex. TR05 (2005)
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-12 21:00 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: