Practical verifiably encrypted signatures without random oracles

DOI10.1016/J.INS.2014.03.092MaRDI QIDQ506783zbMATHOpenAlexWikidataFDO

Authors Zuhua Shao, Yipeng Gao

Publication date 2 February 2017

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2014.03.092

zbMATH Keywords

standard modelfair exchangeverifiably encrypted signaturestrong Diffie-Hellman problemstrong extraction problem

Mathematics Subject Classification ID

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

Recommendations

• Verifiable encrypted signatures without random oracles
• Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
• On the security of the verifiably-encrypted signature scheme of Boneh, Gentry, Lynn and Shacham
• Identity-based verifiably encrypted signatures without random oracles
• Certificate-based verifiably encrypted signatures from pairings

Cites work

• scientific article; zbMATH DE number 1583789 (Why is no real title available?)
• scientific article; zbMATH DE number 1302800 (Why is no real title available?)
• scientific article; zbMATH DE number 2009971 (Why is no real title available?)
• scientific article; zbMATH DE number 2086700 (Why is no real title available?)
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A simple protocol for signing contracts
• Certificate-based fair exchange protocol of signatures from pairings
• Certificate-based verifiably encrypted signatures from pairings
• Efficient Identity-Based Encryption Without Random Oracles
• Efficient Optimistic Fair Exchange Secure in the Multi-user Setting and Chosen-Key Model without Random Oracles
• Information security practice and experience. Third international conference, ISPEC 2007, Hong Kong, China, May 7--9, 2007. Proceedings
• Progress in Cryptology - INDOCRYPT 2003
• Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
• Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
• Short signatures without random oracles and the SDH assumption in bilinear groups
• The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks
• Verifiable encrypted signatures without random oracles

Cited in

(15)

• Signcryption with non-interactive non-repudiation
• A practical and insider secure signcryption with non-interactive non-repudiation
• Intrusion-resilient identity-based signatures: concrete scheme in the standard model and generic construction
• Signature schemes with randomized verification
• Topics in Cryptology – CT-RSA 2006
• Short and efficient convertible undeniable signature schemes without random oracles
• Verifiable encrypted signatures without random oracles
• Practical and tightly-secure digital signatures and authenticated key exchange
• Concurrent Blind Signatures Without Random Oracles
• Rethinking verifiably encrypted signatures: a gap in functionality and potential solutions
• Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
• Identity-based verifiably encrypted signatures without random oracles
• Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions
• Concurrent signature without random oracles
• Signatures on randomizable ciphertexts

This page was built for publication: Practical verifiably encrypted signatures without random oracles

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