Corrigendum: Public‐key encryption indistinguishable under plaintext‐checkable attacks

artículo científico publicado en 2020

Disjunctions for Hash Proof Systems: New Constructions and Applications

Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages

scholarly article by Fabrice Benhamouda et al published 2013 in Lecture Notes in Computer Science

Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting

New Techniques for SPHFs and Efficient One-Round PAKE Protocols

On the Tightness of Forward-Secure Signature Reductions

Public-Key Encryption Indistinguishable Under Plaintext-Checkable Attacks

Public-key encryption indistinguishable under plaintext-checkable attacks

Removing Erasures with Explainable Hash Proof Systems

SPHF-Friendly Non-interactive Commitments

Tighter Reductions for Forward-Secure Signature Schemes