default search action
Miguel Ambrona
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c15]Miguel Ambrona, Pooya Farshim, Patrick Harasser:
Block Ciphers in Idealized Models: Automated Proofs and New Security Results. CCS 2024: 2771-2785 - [c14]Masayuki Abe, Miguel Ambrona, Miyako Ohkubo:
Hybrid Zero-Knowledge from Garbled Circuits and Circuit-Based Composition of Σ-Protocols. SCN (1) 2024: 73-95 - [i14]Miguel Ambrona, Pooya Farshim, Patrick Harasser:
Block Ciphers in Idealized Models: Automated Proofs and New Security Results. IACR Cryptol. ePrint Arch. 2024: 1584 (2024) - [i13]Masayuki Abe, Miguel Ambrona, Miyako Ohkubo:
Hybrid Zero-Knowledge from Garbled Circuits. IACR Cryptol. ePrint Arch. 2024: 1835 (2024) - 2023
- [c13]Miguel Ambrona, Marc Beunardeau, Anne-Laure Schmitt, Raphael R. Toledo:
aPlonK: Aggregated PlonK from Multi-polynomial Commitment Schemes. IWSEC 2023: 195-213 - [c12]Miguel Ambrona, Romain Gay:
Multi-authority ABE for Non-monotonic Access Structures. Public Key Cryptography (2) 2023: 306-335 - [i12]Miguel Ambrona, Marc Beunardeau, Raphael R. Toledo:
Timed Commitments Revisited. IACR Cryptol. ePrint Arch. 2023: 977 (2023) - 2022
- [j2]Masayuki Abe, Miguel Ambrona:
Blind key-generation attribute-based encryption for general predicates. Des. Codes Cryptogr. 90(10): 2271-2299 (2022) - [c11]Itsaka Rakotonirina, Miguel Ambrona, Alejandro Aguirre, Gilles Barthe:
Symbolic Synthesis of Indifferentiability Attacks. AsiaCCS 2022: 667-681 - [c10]Miguel Ambrona:
A Practical Algorithm for Chess Unwinnability. FUN 2022: 2:1-2:20 - [i11]Miguel Ambrona, Anne-Laure Schmitt, Raphael R. Toledo, Danny Willems:
New optimization techniques for PlonKâs arithmetization. IACR Cryptol. ePrint Arch. 2022: 462 (2022) - [i10]Miguel Ambrona, Marc Beunardeau, Anne-Laure Schmitt, Raphael R. Toledo:
aPlonK : Aggregated PlonK from Multi-Polynomial Commitment Schemes. IACR Cryptol. ePrint Arch. 2022: 1352 (2022) - 2021
- [j1]Miguel Ambrona, Dario Fiore, Claudio Soriente:
Controlled Functional Encryption Revisited: Multi-Authority Extensions and Efficient Schemes for Quadratic Functions. Proc. Priv. Enhancing Technol. 2021(1): 21-42 (2021) - [c9]Miguel Ambrona:
Generic Negation of Pair Encodings. Public Key Cryptography (2) 2021: 120-146 - [c8]Masayuki Abe, Miguel Ambrona, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen:
Acyclicity Programming for Sigma-Protocols. TCC (1) 2021: 435-465 - [i9]Masayuki Abe, Miguel Ambrona, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen:
Acyclicity Programming for Sigma-Protocols. IACR Cryptol. ePrint Arch. 2021: 135 (2021) - [i8]Miguel Ambrona:
Generic Negation of Pair Encodings. IACR Cryptol. ePrint Arch. 2021: 177 (2021) - [i7]Masayuki Abe, Miguel Ambrona, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen:
Non-Interactive Composition of Sigma-Protocols via Share-then-Hash. IACR Cryptol. ePrint Arch. 2021: 457 (2021) - [i6]Miguel Ambrona, Romain Gay:
Multi-Authority ABE, Revisited. IACR Cryptol. ePrint Arch. 2021: 1381 (2021) - 2020
- [c7]Masayuki Abe, Miguel Ambrona, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen:
Non-interactive Composition of Sigma-Protocols via Share-then-Hash. ASIACRYPT (3) 2020: 749-773 - [c6]Ky Nguyen, Miguel Ambrona, Masayuki Abe:
WI is Almost Enough: Contingent Payment All Over Again. CCS 2020: 641-656 - [c5]Masayuki Abe, Miguel Ambrona, Miyako Ohkubo:
On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness. Public Key Cryptography (1) 2020: 558-589
2010 – 2019
- 2019
- [i5]Masayuki Abe, Miguel Ambrona, Miyako Ohkubo:
Black-Box Language Extension of Non-Interactive Zero-Knowledge Arguments. IACR Cryptol. ePrint Arch. 2019: 696 (2019) - 2018
- [b1]Miguel Ambrona:
Automated Analysis of Cryptographic Constructions. Technical University of Madrid, Spain, 2018 - [c4]Masayuki Abe, Miguel Ambrona, Miyako Ohkubo, Mehdi Tibouchi:
Lower Bounds on Structure-Preserving Signatures for Bilateral Messages. SCN 2018: 3-22 - [i4]Masayuki Abe, Miguel Ambrona, Miyako Ohkubo, Mehdi Tibouchi:
Lower Bounds on Structure-Preserving Signatures for Bilateral Messages. IACR Cryptol. ePrint Arch. 2018: 640 (2018) - 2017
- [c3]Miguel Ambrona, Gilles Barthe, Romain Gay, Hoeteck Wee:
Attribute-Based Encryption in the Generic Group Model: Automated Proofs and New Constructions. CCS 2017: 647-664 - [c2]Miguel Ambrona, Gilles Barthe, Benedikt Schmidt:
Generic Transformations of Predicate Encodings: Constructions and Applications. CRYPTO (1) 2017: 36-66 - [i3]Miguel Ambrona, Gilles Barthe, Romain Gay, Hoeteck Wee:
Attribute-Based Encryption in the Generic Group Model: Automated Proofs and New Constructions. IACR Cryptol. ePrint Arch. 2017: 983 (2017) - 2016
- [c1]Miguel Ambrona, Gilles Barthe, Benedikt Schmidt:
Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group Model. EUROCRYPT (2) 2016: 822-851 - [i2]Miguel Ambrona, Gilles Barthe, Benedikt Schmidt:
Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group Model. IACR Cryptol. ePrint Arch. 2016: 270 (2016) - [i1]Miguel Ambrona, Gilles Barthe, Benedikt Schmidt:
Generic Transformations of Predicate Encodings: Constructions and Applications. IACR Cryptol. ePrint Arch. 2016: 1105 (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-12-23 19:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint