Relation between verifiable random functions and convertible undeniable signatures, and new constructions

DOI10.1007/978-3-642-31448-3_18MaRDI QIDQ2907375zbMATH OpenOpenAlexFDO

Authors Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong

Publication date 7 September 2012

Published in Information Security and Privacy (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31448-3_18

zbMATH Keywords

standard modelverifiable random functionselectively convertible undeniable signatures

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
• New Approach for Selectively Convertible Undeniable Signature Schemes
• (Convertible) Undeniable Signatures Without Random Oracles
• Efficient Construction of (Distributed) Verifiable Random Functions
• Short and efficient convertible undeniable signature schemes without random oracles

Cited in

(1)

• The price of verifiability: lower bounds for verifiable random functions

This page was built for publication: Relation between verifiable random functions and convertible undeniable signatures, and new constructions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2907375)