default search action
Carla Ràfols
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Oussama Amine, Karim Baghery
, Zaira Pindado, Carla Ràfols:
Simulation extractable versions of Groth's zk-SNARK revisited. Int. J. Inf. Sec. 23(1): 431-445 (2024) - [i23]Anca Nitulescu, Nikitas Paslis, Carla Ràfols:
FLIP-and-prove R1CS. IACR Cryptol. ePrint Arch. 2024: 1364 (2024) - 2023
- [j10]Steven D. Galbraith, Rosario Gennaro, Carla Ràfols, Ron Steinfeld:
Guest editorial: Special issue on Mathematics of Zero-Knowledge. Des. Codes Cryptogr. 91(11): 3331-3332 (2023) - [c25]Carla Ràfols
Folding Schemes with Selective Verification. LATINCRYPT 2023: 229-248 - 2022
- [j9]Karim Baghery
Signatures of knowledge for Boolean circuits under standard assumptions. Theor. Comput. Sci. 916: 86-110 (2022) - [c24]Matteo Campanelli
Linear-Map Vector Commitments and Their Practical Applications. ASIACRYPT (4) 2022: 189-219 - [i22]Matteo Campanelli, Anca Nitulescu, Carla Ràfols, Alexandros Zacharakis, Arantxa Zapico:
Linear-map Vector Commitments and their Practical Applications. IACR Cryptol. ePrint Arch. 2022: 705 (2022) - [i21]Arantxa Zapico, Ariel Gabizon, Dmitry Khovratovich, Mary Maller, Carla Ràfols:
Baloo: Nearly Optimal Lookup Arguments. IACR Cryptol. ePrint Arch. 2022: 1565 (2022) - [i20]Carla Ràfols, Alexandros Zacharakis:
Folding Schemes with Selective Verification. IACR Cryptol. ePrint Arch. 2022: 1576 (2022) - 2021
- [c23]Carla Ràfols
An Algebraic Framework for Universal and Updatable SNARKs. CRYPTO (1) 2021: 774-804 - [e1]Patrick Longa
Progress in Cryptology - LATINCRYPT 2021 - 7th International Conference on Cryptology and Information Security in Latin America, Bogotá, Colombia, October 6-8, 2021, Proceedings. Lecture Notes in Computer Science 12912, Springer 2021, ISBN 978-3-030-88237-2 [contents] - [i19]Carla Ràfols, Arantxa Zapico:
An Algebraic Framework for Universal and Updatable SNARKs. IACR Cryptol. ePrint Arch. 2021: 590 (2021) - 2020
- [c22]Carla Ràfols
QA-NIZK Arguments of Same Opening for Bilateral Commitments. AFRICACRYPT 2020: 3-23 - [c21]Karim Baghery
Signatures of Knowledge for Boolean Circuits Under Standard Assumptions. AFRICACRYPT 2020: 24-44 - [c20]Karim Baghery
Simulation Extractable Versions of Groth's zk-SNARK Revisited. CANS 2020: 453-461 - [c19]Vanesa Daza, Carla Ràfols
Updateable Inner Product Argument with Logarithmic Verifier and Applications. Public Key Cryptography (1) 2020: 527-557 - [i18]Carla Ràfols, Javier Silva:
QA-NIZK Arguments of Same Opening for Bilateral Commitments. IACR Cryptol. ePrint Arch. 2020: 569 (2020) - [i17]Karim Baghery, Alonso González, Zaira Pindado, Carla Ràfols:
Signatures of Knowledge for Boolean Circuits under Standard Assumptions (Full version). IACR Cryptol. ePrint Arch. 2020: 1189 (2020) - [i16]Karim Baghery, Zaira Pindado, Carla Ràfols:
Simulation Extractable Versions of Groth's zk-SNARK Revisited. IACR Cryptol. ePrint Arch. 2020: 1306 (2020) - [i15]Vanesa Daza, Carla Ràfols, Alexandros Zacharakis:
Updateable Inner Product Argument with Logarithmic Verifier and Applications. IACR Cryptol. ePrint Arch. 2020: 1333 (2020)
2010 – 2019
- 2019
- [j8]Mojtaba Khalili, Mohammad Dakhilalian
Short tightly secure signatures for signing a vector of group elements: A new approach. Theor. Comput. Sci. 795: 225-239 (2019) - [c18]Antonio Faonio
Structure-Preserving and Re-randomizable RCCA-Secure Public Key Encryption and Its Applications. ASIACRYPT (3) 2019: 159-190 - [c17]Alonso González, Carla Ràfols
Shorter Pairing-Based Arguments Under Standard Assumptions. ASIACRYPT (3) 2019: 728-757 - [c16]Vanesa Daza
Shorter Quadratic QA-NIZK Proofs. Public Key Cryptography (1) 2019: 314-343 - [i14]Vanesa Daza, Alonso González, Zaira Pindado, Carla Ràfols, Javier Silva:
Shorter Quadratic QA-NIZK Proofs. IACR Cryptol. ePrint Arch. 2019: 173 (2019) - [i13]Alonso González, Carla Ràfols:
Sublinear Pairing-based Arguments with Updatable CRS and Weaker Assumptions. IACR Cryptol. ePrint Arch. 2019: 326 (2019) - [i12]Antonio Faonio
Structure-Preserving and Re-randomizable RCCA-secure Public Key Encryption and its Applications. IACR Cryptol. ePrint Arch. 2019: 955 (2019) - 2018
- [j7]Josep Domingo-Ferrer
Dynamic group size accreditation and group discounts preserving anonymity. Int. J. Inf. Sec. 17(3): 243-260 (2018) - 2017
- [j6]Alex Escala, Gottfried Herold, Eike Kiltz
An Algebraic Framework for Diffie-Hellman Assumptions. J. Cryptol. 30(1): 242-288 (2017) - [c15]Gottfried Herold, Max Hoffmann
New Techniques for Structural Batch Verification in Bilinear Groups with Applications to Groth-Sahai Proofs. CCS 2017: 1547-1564 - [i11]Gottfried Herold, Max Hoffmann, Michael Klooß, Carla Ràfols, Andy Rupp
New Techniques for Structural Batch Verification in Bilinear Groups with Applications to Groth-Sahai Proofs. IACR Cryptol. ePrint Arch. 2017: 802 (2017) - 2016
- [c14]Alonso González, Carla Ràfols
New Techniques for Non-interactive Shuffle and Range Arguments. ACNS 2016: 427-444 - [c13]Paz Morillo, Carla Ràfols
The Kernel Matrix Diffie-Hellman Assumption. ASIACRYPT (1) 2016: 729-758 - 2015
- [c12]Alonso González, Alejandro Hevia, Carla Ràfols
QA-NIZK Arguments in Asymmetric Groups: New Tools and New Constructions. ASIACRYPT (1) 2015: 605-629 - [c11]Carla Ràfols
Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability. TCC (2) 2015: 247-276 - [i10]Carla Ràfols:
Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability. IACR Cryptol. ePrint Arch. 2015: 50 (2015) - [i9]Paz Morillo, Carla Ràfols, Jorge L. Villar:
Matrix Computational Assumptions in Multilinear Groups. IACR Cryptol. ePrint Arch. 2015: 353 (2015) - [i8]Alonso González, Alejandro Hevia, Carla Ràfols:
QA-NIZK Arguments in Asymmetric Groups: New Tools and New Constructions. IACR Cryptol. ePrint Arch. 2015: 910 (2015) - 2014
- [c10]Gottfried Herold, Julia Hesse, Dennis Hofheinz, Carla Ràfols
Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations. CRYPTO (1) 2014: 261-279 - [c9]Alex Escala, Javier Herranz
Identity-Based Lossy Trapdoor Functions: New Definitions, Hierarchical Extensions, and Implications. Public Key Cryptography 2014: 239-256 - [i7]Gottfried Herold, Julia Hesse, Dennis Hofheinz, Carla Ràfols, Andy Rupp
Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations. IACR Cryptol. ePrint Arch. 2014: 445 (2014) - 2013
- [c8]Alex Escala, Gottfried Herold, Eike Kiltz
An Algebraic Framework for Diffie-Hellman Assumptions. CRYPTO (2) 2013: 129-147 - [i6]Alex Escala, Gottfried Herold, Eike Kiltz, Carla Ràfols, Jorge L. Villar:
An Algebraic Framework for Diffie-Hellman Assumptions. IACR Cryptol. ePrint Arch. 2013: 377 (2013) - 2012
- [j5]Nuttapong Attrapadung
Attribute-based encryption schemes with constant-size ciphertexts. Theor. Comput. Sci. 422: 15-38 (2012) - [c7]Javier Herranz
Short Attribute-Based Signatures for Threshold Predicates. CT-RSA 2012: 51-67 - [i5]Alex Escala, Javier Herranz, Benoît Libert, Carla Ràfols:
Hierarchical Identity-Based Lossy Trapdoor Functions. CoRR abs/1202.5856 (2012) - [i4]Alex Escala, Javier Herranz, Benoît Libert, Carla Ràfols:
Hierarchical Identity-Based (Lossy) Trapdoor Functions. IACR Cryptol. ePrint Arch. 2012: 503 (2012) - 2011
- [j4]Javier Herranz
Relations between semantic security and anonymity in identity-based encryption. Inf. Process. Lett. 111(10): 453-460 (2011) - 2010
- [j3]Vanesa Daza
Extensions of access structures and their cryptographic applications. Appl. Algebra Eng. Commun. Comput. 21(4): 257-284 (2010) - [c6]Javier Herranz
Constant Size Ciphertexts in Threshold Attribute-Based Encryption. Public Key Cryptography 2010: 19-34
2000 – 2009
- 2009
- [c5]Paz Morillo, Carla Ràfols
The Security of All Bits Using List Decoding. Public Key Cryptography 2009: 15-33 - 2008
- [j2]David Galindo
Improved certificate-based encryption in the standard model. J. Syst. Softw. 81(7): 1218-1226 (2008) - [i3]Vanesa Daza, Javier Herranz, Paz Morillo, Carla Ràfols:
Extended Access Structures and Their Cryptographic Applications. IACR Cryptol. ePrint Arch. 2008: 502 (2008) - 2007
- [j1]Vanesa Daza
Cryptographic techniques for mobile ad-hoc networks. Comput. Networks 51(18): 4938-4950 (2007) - [c4]Vanesa Daza, Javier Herranz, Paz Morillo, Carla Ràfols
CCA2-Secure Threshold Broadcast Encryption with Shorter Ciphertexts. ProvSec 2007: 35-50 - [c3]Vanesa Daza
Ad-Hoc Threshold Broadcast Encryption with Shorter Ciphertexts. WCAN@ICALP 2007: 3-15 - [i2]Vanesa Daza, Javier Herranz, Paz Morillo, Carla Ràfols:
CCA2-Secure Threshold Broadcast Encryption with Shorter Ciphertexts. IACR Cryptol. ePrint Arch. 2007: 127 (2007) - 2006
- [c2]David Galindo, Paz Morillo, Carla Ràfols
Breaking Yum and Lee Generic Constructions of Certificate-Less and Certificate-Based Encryption Schemes. EuroPKI 2006: 81-91 - [c1]Vanesa Daza
On Dynamic Distribution of Private Keys over MANETs. WCAN@ICALP 2006: 33-41 - [i1]Paz Morillo, Carla Ràfols:
Certificate-Based Encryption Without Random Oracles. IACR Cryptol. ePrint Arch. 2006: 12 (2006)
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-10-07 02:31 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: