Advances in Cryptology - EUROCRYPT 2004

DOI10.1007/b97182zbMath1122.94425OpenAlexW2477185671WikidataQ21683979 ScholiaQ21683979MaRDI QIDQ5307277

Stanislaw Jarecki, Vitaly Shmatikov

Publication date: 25 September 2007

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

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

Mathematics Subject Classification ID

Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (6)

The price of verifiability: lower bounds for verifiable random functions ⋮ On the impossibility of structure-preserving deterministic primitives ⋮ Verifiable Random Functions from Standard Assumptions ⋮ Verifiable random functions: relations to identity-based key encapsulation and new constructions ⋮ Verifiable Random Functions from Identity-Based Key Encapsulation ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties

This page was built for publication: Advances in Cryptology - EUROCRYPT 2004