Easy Verifiable Primitives and Practical Public Key Cryptosystems

DOI10.1007/10958513_6zbMath1185.94051OpenAlexW1501308711MaRDI QIDQ3404394

David Galindo, Paz Morillo, Sebastià Martín, Jorge Luis Villar

Publication date: 9 February 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/10958513_6

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Tightly secure ring-LWE based key encapsulation with short ciphertexts ⋮ Identity-based encryption with (almost) tight security in the multi-instance, multi-ciphertext setting ⋮ Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography

This page was built for publication: Easy Verifiable Primitives and Practical Public Key Cryptosystems