Security of Verifiably Encrypted Signatures and a Construction without Random Oracles

DOI10.1007/978-3-642-03298-1_2zbMath1248.94092MaRDI QIDQ3392898

Markus Rückert, Dominique Schröder

Publication date: 18 August 2009

Published in: Pairing-Based Cryptography – Pairing 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03298-1_2

Mathematics Subject Classification ID

94A60: Cryptography

94A62: Authentication, digital signatures and secret sharing

Related Items

Verifiably Encrypted Signatures with Short Keys Based on the Decisional Linear Problem and Obfuscation for Encrypted VES, Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles, Attribute-based optimistic fair exchange: how to restrict brokers with policies, Security of Verifiably Encrypted Signatures and a Construction without Random Oracles

Cites Work

• Unnamed Item
• Unnamed Item
• On the security of the verifiably-encrypted signature scheme of Boneh, Gentry, Lynn and Shacham
• Short signatures without random oracles and the SDH assumption in bilinear groups
• The random oracle methodology, revisited
• Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
• Perfect Non-interactive Zero Knowledge for NP
• Sequential Aggregate Signatures and Multisignatures Without Random Oracles
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Optimistic fair exchange of digital signatures
• Advances in Cryptology - EUROCRYPT 2004
• Efficient Identity-Based Encryption Without Random Oracles
• Pairing-Friendly Elliptic Curves of Prime Order
• Progress in Cryptology - INDOCRYPT 2003
• Optimistic Fair Exchange in a Multi-user Setting