scientific article; zbMATH DE number 1962152
From MaRDI portal
Publication:4418537
zbMath1039.94529MaRDI QIDQ4418537
Publication date: 10 August 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2612/26120211.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Related Items (16)
A generic solution to realize public verifiability of signcryption ⋮ Constructing parallel long-message signcryption scheme from trapdoor permutation ⋮ A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory ⋮ On the security of joint signature and encryption revisited ⋮ An efficient signcryption for data access control in cloud computing ⋮ Certificate-based signcryption with enhanced security features ⋮ Cryptanalysis of a signcryption scheme with fast online signing and short signcryptext ⋮ A fully secure lattice-based signcryption with designated equality test in standard model ⋮ Fully anonymous identity-based broadcast signcryption with public verification ⋮ Signcryption Schemes Based on the RSA Problem ⋮ Signcryption schemes with insider security in an ideal permutation model ⋮ Signcryption from randomness recoverable public key encryption ⋮ A lattice-based signcryption scheme without random oracles ⋮ Efficient Identity-Based Signcryption in the Standard Model ⋮ Efficient and Provably Secure Certificateless Multi-receiver Signcryption ⋮ Conjugacy systems based on nonabelian factorization problems and their applications in cryptography
This page was built for publication:
