Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
From MaRDI portal
Recommendations
- Verifiable encrypted signatures without random oracles
- Practical verifiably encrypted signatures without random oracles
- Generic constructions for verifiably encrypted signatures without random oracles or NIZKs
- On the security of the verifiably-encrypted signature scheme of Boneh, Gentry, Lynn and Shacham
- Rethinking verifiably encrypted signatures: a gap in functionality and potential solutions
Cites work
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Identity-Based Encryption Without Random Oracles
- scientific article; zbMATH DE number 2009971 (Why is no real title available?)
- scientific article; zbMATH DE number 1418311 (Why is no real title available?)
- On the security of the verifiably-encrypted signature scheme of Boneh, Gentry, Lynn and Shacham
- Optimistic Fair Exchange in a Multi-user Setting
- Optimistic fair exchange of digital signatures
- Pairing-Friendly Elliptic Curves of Prime Order
- Perfect Non-interactive Zero Knowledge for NP
- Progress in Cryptology - INDOCRYPT 2003
- Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- Short signatures without random oracles and the SDH assumption in bilinear groups
- The random oracle methodology, revisited.
Cited in
(25)- On the security of the verifiably-encrypted signature scheme of Boneh, Gentry, Lynn and Shacham
- Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
- Attribute-based optimistic fair exchange: how to restrict brokers with policies
- scientific article; zbMATH DE number 1583789 (Why is no real title available?)
- Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures
- Structure-preserving signatures and commitments to group elements
- Signatures on randomizable ciphertexts
- Secure Obfuscation of Encrypted Verifiable Encrypted Signatures
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
- Verifiable encryption of digital signatures and applications
- Generic constructions for verifiably encrypted signatures without random oracles or NIZKs
- Identity-based verifiably encrypted signatures without random oracles
- Sequential aggregate signatures with lazy verification from trapdoor permutations
- Optimistic fair exchange in the enhanced chosen-key model
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
- Practical verifiably encrypted signatures without random oracles
- Rethinking verifiably encrypted signatures: a gap in functionality and potential solutions
- Multi-party Stand-Alone and Setup-Free Verifiably Committed Signatures
- Topics in Cryptology – CT-RSA 2006
- On structure-preserving cryptography and lattices
- Multi-designated verifiers signatures: anonymity without encryption
- Verifiable encrypted signatures without random oracles
- Verifying a signature architecture: a comparative case study
This page was built for publication: Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392898)
