Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlain Passelègue
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i17]Julien Devevey, Pouria Fallahpour, Alain Passelègue, Damien Stehlé:
A Detailed Analysis of Fiat-Shamir with Aborts. IACR Cryptol. ePrint Arch. 2023: 245 (2023)- 2022
- [c19]Julien Devevey, Omar Fawzi, Alain Passelègue, Damien Stehlé:
On Rejection Sampling in Lyubashevsky's Signature Scheme. ASIACRYPT (4) 2022: 34-64 - [c18]Benoît Libert, Alain Passelègue, Mahshid Riahinia:
PointProofs, Revisited. ASIACRYPT (4) 2022: 220-246 - [c17]Calvin Abou Haidar, Benoît Libert, Alain Passelègue:
Updatable Public Key Encryption from DCR: Efficient Constructions With Stronger Security. CCS 2022: 11-22 - [c16]Benoît Libert, Alain Passelègue, Mahshid Riahinia:
New and Improved Constructions for Partially Equivocable Public Key Encryption. SCN 2022: 197-219 - [c15]Benoît Libert, Ky Nguyen, Alain Passelègue:
Cumulatively All-Lossy-But-One Trapdoor Functions from Standard Assumptions. SCN 2022: 336-361 - [i16]Benoît Libert, Ky Nguyen, Alain Passelègue:
Cumulatively All-Lossy-But-One Trapdoor Functions from Standard Assumptions. IACR Cryptol. ePrint Arch. 2022: 1229 (2022) - [i15]Julien Devevey, Omar Fawzi, Alain Passelègue, Damien Stehlé:
On Rejection Sampling in Lyubashevsky's Signature Scheme. IACR Cryptol. ePrint Arch. 2022: 1249 (2022) - [i14]Benoît Libert, Alain Passelègue, Mahshid Riahinia:
New and Improved Constructions for Partially Equivocable Public Key Encryption. IACR Cryptol. ePrint Arch. 2022: 1733 (2022) - 2020
- [j2]Nir Bitansky, Ryo Nishimaki, Alain Passelègue, Daniel Wichs:
From Cryptomania to Obfustopia Through Secret-Key Functional Encryption. J. Cryptol. 33(2): 357-405 (2020) - [c14]Benoît Libert, Khoa Nguyen
, Alain Passelègue, Radu Titiu:
Simulation-Sound Arguments for LWE and Applications to KDM-CCA2 Security. ASIACRYPT (1) 2020: 128-158 - [c13]Benoît Libert, Alain Passelègue, Hoeteck Wee, David J. Wu:
New Constructions of Statistical NIZKs: Dual-Mode DV-NIZKs and More. EUROCRYPT (3) 2020: 410-441 - [c12]Pooya Farshim, Georg Fuchsbauer, Alain Passelègue:
Simpler Constructions of Asymmetric Primitives from Obfuscation. INDOCRYPT 2020: 715-738 - [i13]Benoît Libert, Alain Passelègue, Hoeteck Wee, David J. Wu:
New Constructions of Statistical NIZKs: Dual-Mode DV-NIZKs and More. IACR Cryptol. ePrint Arch. 2020: 265 (2020)
2010 – 2019
- 2019
- [c11]Michel Abdalla, Fabrice Benhamouda, Alain Passelègue:
Algebraic XOR-RKA-Secure Pseudorandom Functions from Post-Zeroizing Multilinear Maps. ASIACRYPT (2) 2019: 386-412 - [c10]Thomas Prest, Dahmun Goudarzi, Ange Martinelli, Alain Passelègue:
Unifying Leakage Models on a Rényi Day. CRYPTO (1) 2019: 683-712 - [i12]Dahmun Goudarzi, Ange Martinelli, Alain Passelègue, Thomas Prest:
Unifying Leakage Models on a Rényi Day. IACR Cryptol. ePrint Arch. 2019: 138 (2019) - [i11]Benoît Libert, Khoa Nguyen, Alain Passelègue, Radu Titiu:
Simulation-Sound Proofs for LWE and Applications to KDM-CCA2 Security. IACR Cryptol. ePrint Arch. 2019: 908 (2019) - 2018
- [j1]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) - [c9]Zvika Brakerski, Aayush Jain, Ilan Komargodski, Alain Passelègue, Daniel Wichs:
Non-trivial Witness Encryption and Null-iO from Standard Assumptions. SCN 2018: 425-441 - [c8]Marc Joye, Alain Passelègue:
Function-Revealing Encryption - Definitions and Constructions. SCN 2018: 527-543 - [c7]Dan Boneh, Yuval Ishai, Alain Passelègue, Amit Sahai, David J. Wu:
Exploring Crypto Dark Matter: - New Simple PRF Candidates and Their Applications. TCC (2) 2018: 699-729 - [i10]Pooya Farshim, Georg Fuchsbauer, Alain Passelègue:
Simpler Constructions of Asymmetric Primitives from Obfuscation. IACR Cryptol. ePrint Arch. 2018: 576 (2018) - [i9]Dan Boneh, Yuval Ishai, Alain Passelègue, Amit Sahai, David J. Wu:
Exploring Crypto Dark Matter: New Simple PRF Candidates and Their Applications. IACR Cryptol. ePrint Arch. 2018: 1218 (2018) - 2017
- [c6]Sonia Belaïd, Fabrice Benhamouda, Alain Passelègue, Emmanuel Prouff, Adrian Thillard, Damien Vergnaud:
Private Multiplication over Finite Fields. CRYPTO (3) 2017: 397-426 - [i8]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) - [i7]Zvika Brakerski, Aayush Jain, Ilan Komargodski, Alain Passelègue, Daniel Wichs:
Non-Trivial Witness Encryption and Null-iO from Standard Assumptions. IACR Cryptol. ePrint Arch. 2017: 874 (2017) - 2016
- [b1]Alain Passelègue:
Algebraic Frameworks for Pseudorandom Functions. PSL Research University, Paris, France, 2016 - [c5]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 - [c4]Nir Bitansky, Ryo Nishimaki, Alain Passelègue, Daniel Wichs:
From Cryptomania to Obfustopia Through Secret-Key Functional Encryption. TCC (B2) 2016: 391-418 - [i6]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) - [i5]Nir Bitansky, Ryo Nishimaki, Alain Passelègue, Daniel Wichs:
From Cryptomania to Obfustopia through Secret-Key Functional Encryption. IACR Cryptol. ePrint Arch. 2016: 558 (2016) - [i4]Marc Joye, Alain Passelègue:
Practical Trade-Offs for Multi-Input Functional Encryption. IACR Cryptol. ePrint Arch. 2016: 622 (2016) - 2015
- [c3]Michel Abdalla, Fabrice Benhamouda, Alain Passelègue:
Multilinear and Aggregate Pseudorandom Functions: New Constructions and Improved Security. ASIACRYPT (1) 2015: 103-120 - [c2]Michel Abdalla, Fabrice Benhamouda, Alain Passelègue:
An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security. CRYPTO (1) 2015: 388-409 - [i3]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) - [i2]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
- [c1]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 - [i1]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)
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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 2023-03-01 23:31 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:
