Practical verifiably encrypted signatures without random oracles
From MaRDI portal
Publication:506783
DOI10.1016/J.INS.2014.03.092zbMath1354.94060OpenAlexW1968029485WikidataQ122179103 ScholiaQ122179103MaRDI QIDQ506783
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
standard modelfair exchangeverifiably encrypted signaturestrong Diffie-Hellman problemstrong extraction problem
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Verifiable encrypted signatures without random oracles
- Certificate-based verifiably encrypted signatures from pairings
- Information security practice and experience. Third international conference, ISPEC 2007, Hong Kong, China, May 7--9, 2007. Proceedings
- Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
- Certificate-based fair exchange protocol of signatures from pairings
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A Simple Protocol for Signing Contracts
- Efficient Identity-Based Encryption Without Random Oracles
- Progress in Cryptology - INDOCRYPT 2003
- The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks
- Efficient Optimistic Fair Exchange Secure in the Multi-user Setting and Chosen-Key Model without Random Oracles
This page was built for publication: Practical verifiably encrypted signatures without random oracles
