Verifiably encrypted signatures: security revisited and a new construction

DOI10.1007/978-3-319-24174-6_8zbMATH Open1504.94212OpenAlexW2295677804MaRDI QIDQ5097044FDOQ5097044

Authors: Christian Hanser, Max Rabkin, Dominique Schröder 

Publication date: 19 August 2022

Published in: Computer Security -- ESORICS 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-24174-6_8

Recommendations

• Rethinking verifiably encrypted signatures: a gap in functionality and potential solutions
• Generic constructions for verifiably encrypted signatures without random oracles or NIZKs
• Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
• Structure-preserving signatures on equivalence classes from standard assumptions
• Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES

zbMATH Keywords

public-key encryptionstructure-preserving signaturesverifiably encrypted signaturesresolution independence

Mathematics Subject Classification ID

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

Cited In (25)

• A generic solution to realize public verifiability of signcryption
• Title not available (Why is that?)
• A constructive perspective on signcryption security
• Transitive Signatures: New Schemes and Proofs
• Verifying a signature architecture: a comparative case study
• On Generic Constructions of Designated Confirmer Signatures
• Rethinking verifiably encrypted signatures: a gap in functionality and potential solutions
• Practical and tightly-secure digital signatures and authenticated key exchange
• A formal concept of domain pseudonymous signatures
• Secure Obfuscation of Encrypted Verifiable Encrypted Signatures
• Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
• Confidential Signatures and Deterministic Signcryption
• A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
• On the security notions for homomorphic signatures
• On proving equivalence class signatures secure from non-interactive assumptions
• Deterring Certificate Subversion: Efficient Double-Authentication-Preventing Signatures
• Title not available (Why is that?)
• Title not available (Why is that?)
• Advances in Cryptology - CRYPTO 2003
• Title not available (Why is that?)
• On the security of the verifiably-encrypted signature scheme of Boneh, Gentry, Lynn and Shacham
• Key-Versatile Signatures and Applications: RKA, KDM and Joint Enc/Sig
• Tightly Secure Signatures and Public-Key Encryption
• Certificate-based verifiably encrypted signatures from pairings
• New efficient and secure protocols for verifiable signature sharing and other applications

This page was built for publication: Verifiably encrypted signatures: security revisited and a new construction

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