Miguel Ambrona

Orcid: 0000-0001-5927-9235

According to our database1, Miguel Ambrona authored at least 25 papers between 2016 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Efficient Foreign-Field Arithmetic in PLONK.
IACR Cryptol. ePrint Arch., 2025

2024
Hybrid Zero-Knowledge from Garbled Circuits.
IACR Cryptol. ePrint Arch., 2024

Hybrid Zero-Knowledge from Garbled Circuits and Circuit-Based Composition of Σ-Protocols.
Proceedings of the Security and Cryptography for Networks - 14th International Conference, 2024

Block Ciphers in Idealized Models: Automated Proofs and New Security Results.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

2023
Timed Commitments Revisited.
IACR Cryptol. ePrint Arch., 2023

Multi-authority ABE for Non-monotonic Access Structures.
Proceedings of the Public-Key Cryptography - PKC 2023, 2023

a<i>P</i>lon<i>K</i>: Aggregated <i>P</i>lon<i>K</i> from Multi-polynomial Commitment Schemes.
Proceedings of the Advances in Information and Computer Security, 2023

2022
New optimization techniques for PlonK’s arithmetization.
IACR Cryptol. ePrint Arch., 2022

aPlonK : Aggregated PlonK from Multi-Polynomial Commitment Schemes.
IACR Cryptol. ePrint Arch., 2022

Blind key-generation attribute-based encryption for general predicates.
Des. Codes Cryptogr., 2022

A Practical Algorithm for Chess Unwinnability.
Proceedings of the 11th International Conference on Fun with Algorithms, 2022

Symbolic Synthesis of Indifferentiability Attacks.
Proceedings of the ASIA CCS '22: ACM Asia Conference on Computer and Communications Security, Nagasaki, Japan, 30 May 2022, 2022

2021
Controlled Functional Encryption Revisited: Multi-Authority Extensions and Efficient Schemes for Quadratic Functions.
Proc. Priv. Enhancing Technol., 2021

Multi-Authority ABE, Revisited.
IACR Cryptol. ePrint Arch., 2021

Acyclicity Programming for Sigma-Protocols.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Generic Negation of Pair Encodings.
Proceedings of the Public-Key Cryptography - PKC 2021, 2021

2020
On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness.
Proceedings of the Public-Key Cryptography - PKC 2020, 2020

WI is Almost Enough: Contingent Payment All Over Again.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

Non-interactive Composition of Sigma-Protocols via Share-then-Hash.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019
Black-Box Language Extension of Non-Interactive Zero-Knowledge Arguments.
IACR Cryptol. ePrint Arch., 2019

2018
Automated Analysis of Cryptographic Constructions.
PhD thesis, 2018

Lower Bounds on Structure-Preserving Signatures for Bilateral Messages.
Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

2017
Generic Transformations of Predicate Encodings: Constructions and Applications.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Attribute-Based Encryption in the Generic Group Model: Automated Proofs and New Constructions.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2016
Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group Model.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016


  Loading...