default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRafaël Del Pino
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Rafaël del Pino, Shuichi Katsumata
, Thomas Prest, Mélissa Rossi:
Raccoon: A Masking-Friendly Signature Proven in the Probing Model. CRYPTO (1) 2024: 409-444- [c11]Rafaël Del Pino, Shuichi Katsumata, Mary Maller, Fabrice Mouhartem, Thomas Prest, Markku-Juhani O. Saarinen:
Threshold Raccoon: Practical Threshold Signatures from Standard Lattice Assumptions. EUROCRYPT (2) 2024: 219-248 - [i10]Rafaël Del Pino, Shuichi Katsumata, Mary Maller, Fabrice Mouhartem, Thomas Prest, Markku-Juhani O. Saarinen:
Threshold Raccoon: Practical Threshold Signatures from Standard Lattice Assumptions. IACR Cryptol. ePrint Arch. 2024: 184 (2024) - [i9]Rafaël del Pino, Shuichi Katsumata, Thomas Prest, Mélissa Rossi:
Raccoon: A Masking-Friendly Signature Proven in the Probing Model. IACR Cryptol. ePrint Arch. 2024: 1291 (2024) - 2023
- [c10]Rafaël del Pino, Thomas Prest, Mélissa Rossi, Markku-Juhani O. Saarinen:
High-Order Masking of Lattice Signatures in Quasilinear Time. SP 2023: 1168-1185 - 2022
- [c9]Rafaël del Pino, Shuichi Katsumata:
A New Framework for More Efficient Round-Optimal Lattice-Based (Partially) Blind Signature via Trapdoor Sampling. CRYPTO (2) 2022: 306-336 - [i8]Rafaël del Pino, Shuichi Katsumata:
A New Framework For More Efficient Round-Optimal Lattice-Based (Partially) Blind Signature via Trapdoor Sampling. IACR Cryptol. ePrint Arch. 2022: 834 (2022)
2010 – 2019
- 2019
- [c8]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 - [i7]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) - 2018
- [b1]Rafaël del Pino:
Efficient lattice-based zero-knowledge proofs and applications. (Preuves à divulgation nulle de connaissance efficaces à base de réseaux euclidiens et applications). PSL Research University, Paris, France, 2018 - [c7]Rafaël del Pino, Vadim Lyubashevsky, Gregor Seiler:
Lattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism Stability. CCS 2018: 574-591 - [c6]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 - [i6]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) - [i5]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
- [c5]Rafaël del Pino, Vadim Lyubashevsky, Gregory Neven, Gregor Seiler:
Practical Quantum-Safe Voting from Lattices. CCS 2017: 1565-1581 - [c4]Rafaël del Pino, Vadim Lyubashevsky:
Amortization with Fewer Equations for Proving Knowledge of Small Secrets. CRYPTO (3) 2017: 365-394 - [i4]Rafaël Del Pino, Vadim Lyubashevsky:
Amortization with Fewer Equations for Proving Knowledge of Small Secrets. IACR Cryptol. ePrint Arch. 2017: 280 (2017) - [i3]Rafaël del Pino, Vadim Lyubashevsky, Gregory Neven, Gregor Seiler:
Practical Quantum-Safe Voting from Lattices. IACR Cryptol. ePrint Arch. 2017: 1235 (2017) - 2016
- [j1]Mariem El Afrit, Yann Le Du, Rafaël Del Pino, Guolin Zhang:
Data merging for the cultural heritage imaging based on Chebfun approach. Supercomput. Front. Innov. 3(3): 71-83 (2016) - [c3]Máire O'Neill, Elizabeth O'Sullivan, Gavin McWilliams, Markku-Juhani O. Saarinen, Ciara Moore, Ayesha Khalid, James Howe, Rafaël Del Pino, Michel Abdalla, Francesco Regazzoni, Felipe Valencia, Tim Güneysu, Tobias Oder, Adrian Waller, Glyn Jones, Anthony Barnett, Robert Griffin, Andrew Byrne, Bassem Ammar, David Lund:
Secure architectures of future emerging cryptography SAFEcrypto. Conf. Computing Frontiers 2016: 315-322 - [c2]Florian Bourse, Rafaël Del Pino, Michele Minelli, Hoeteck Wee:
FHE Circuit Privacy Almost for Free. CRYPTO (2) 2016: 62-89 - [c1]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 - [i2]Florian Bourse, Rafaël Del Pino, Michele Minelli, Hoeteck Wee:
FHE Circuit Privacy Almost For Free. IACR Cryptol. ePrint Arch. 2016: 381 (2016) - [i1]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)
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-09-02 20:27 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:
