scientific article; zbMATH DE number 1962145

MaRDI QIDQ4418529zbMATH OpenFDO

Authors Dan Boneh, Ilya Mironov, Victor Shoup

Publication date 10 August 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2612/26120098.htm

zbMATH Keywords

bilinear mapscollision finding algorithmsignature schemesTate pairingWeil pairing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Information Security and Privacy
• Advances in Cryptology – CRYPTO 2004
• Short signatures without random oracles and the SDH assumption in bilinear groups
• scientific article; zbMATH DE number 2009970
• Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps

Cited in

(26)

• The security of the birational permutation signature schemes
• Tightly secure signature schemes from the LWE and subset sum assumptions
• A generic construction of tightly secure signatures in the multi-user setting
• Short signatures without random oracles and the SDH assumption in bilinear groups
• Key regeneration-free ciphertext-policy attribute-based encryption and its application
• On the impossibility of purely algebraic signatures
• Algebraic partitioning: fully compact and (almost) tightly secure cryptography
• A new signature scheme without random oracles from bilinear pairings
• Signcryption schemes based on bilinear maps
• Tightly secure signatures and public-key encryption
• scientific article; zbMATH DE number 5856057 (Why is no real title available?)
• Merkle tree digital signature and trusted computing platform
• Twin signature schemes, revisited
• scientific article; zbMATH DE number 2009970 (Why is no real title available?)
• Confidentiality-preserving publicly verifiable computation
• Creation of identity-based digital signature schemes from bilinear maps
• Cryptanalysis of Two Signature Schemes Based on Bilinear Pairings in CISC ’05
• Advances in Cryptology – CRYPTO 2004
• Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps
• Information Security and Privacy
• Security in Communication Networks
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
• Public Key Cryptography – PKC 2004
• Optimal generic attack against basic Boneh-Boyen signatures
• MPC in the head using the subfield bilinear collision problem
• Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring

This page was built for publication:

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