Non-interactive public-key cryptography

DOI10.1007/3-540-46416-6_43MaRDI QIDQ4037493zbMATH OpenFDO

Authors Ueli M. Maurer, Yacov Yacobi

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46416-6_43

Mathematics Subject Classification ID

Cryptography (94A60)

Cited in

(15)

• A note on Girault's self-certified model
• Perfectly secure key distribution for dynamic conferences
• Efficient subtree-based encryption for fuzzy-entity data sharing
• Fast generation of prime numbers and secure public-key cryptographic parameters.
• A novel ID-based group signature
• Solving discrete logarithm problems faster with the aid of pre-computation
• Provably secure non-interactive key distribution based on pairings
• Algorithms for black-box fields and their application to cryptography
• On the Theoretical Gap between Group Signatures with and without Unlinkability
• An identity-based cryptographic model for discrete logarithm and integer factoring based cryptosystem
• Identity-based non-interactive key distribution with forward security
• An ID-based cryptographic mechanisms based on GDLP and IFP
• (t,m) threshold and generalized ID-based conference key distribution system
• Hierarchical identity-based encryption with receiver selective opening security in the multi-challenge setting
• On the relations between non-interactive key distribution, identity-based encryption and trapdoor discrete log groups

This page was built for publication: Non-interactive public-key cryptography

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