( en | de | ru )

 

Disambiguation of "Ambrona, Miguel"

Author of the publication

copydeleteadd this publication to your clipboard
Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group Model.

, , and . EUROCRYPT (2), volume 9666 of Lecture Notes in Computer Science, page 822-851. Springer, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Miguel Beato

Miguel Cardozo

Miguel Cruset

Miguel Astner

Miguel Coelho

 

Other publications of authors with the same name

aPlonK: Aggregated PlonK from Multi-polynomial Commitment Schemes., , , and . IWSEC, volume 14128 of Lecture Notes in Computer Science, page 195-213. Springer, (2023)Non-interactive Composition of Sigma-Protocols via Share-then-Hash., , , , and . ASIACRYPT (3), volume 12493 of Lecture Notes in Computer Science, page 749-773. Springer, (2020)Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group Model., , and . EUROCRYPT (2), volume 9666 of Lecture Notes in Computer Science, page 822-851. Springer, (2016)Black-Box Language Extension of Non-Interactive Zero-Knowledge Arguments., , and . IACR Cryptology ePrint Archive, (2019)On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness., , and . Public Key Cryptography (1), volume 12110 of Lecture Notes in Computer Science, page 558-589. Springer, (2020)Automated Analysis of Cryptographic Constructions.. Technical University of Madrid, Spain, (2018)Hybrid Zero-Knowledge from Garbled Circuits and Circuit-Based Composition of Σ-Protocols., , and . SCN (1), volume 14973 of Lecture Notes in Computer Science, page 73-95. Springer, (2024)Block Ciphers in Idealized Models: Automated Proofs and New Security Results., , and . CCS, page 2771-2785. ACM, (2024)Multi-authority ABE for Non-monotonic Access Structures., and . Public Key Cryptography (2), volume 13941 of Lecture Notes in Computer Science, page 306-335. Springer, (2023)A Practical Algorithm for Chess Unwinnability.. FUN, volume 226 of LIPIcs, page 2:1-2:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)