Multipurpose Identity-Based Signcryption (A Swiss Army Knife for Identity-Based Cryptography)
By Xavier Boyen. Annual International Cryptology Conference, 2003
430 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/41cd3ebc5d9431109308e998a444a14af2599503
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Brent Waters
- Xavier Boyen
- Allison Bishop
- Dan Boneh
- Amit Sahai
- V. Varadharajan
- Junqi Zhang
- Josep Domingo-Ferrer
In Computational Theory and Mathematics
- Brent Waters
- Xavier Boyen
- Allison Bishop
- Dan Boneh
- Amit Sahai
- V. Varadharajan
- Junqi Zhang
- Josep Domingo-Ferrer
Citations in the corpus
- Wireless sensor network key management survey and taxonomy (2010, background): “Therefore, unlike traditional application of public-key infrastructure, a certification authority (CA) could be eliminated in identity-based cryptography for sensor networks, and the problem of impersonation could be resisted by using an identity-based signcryption scheme (Boyen, 2003; Chen and Kudl”
- A Scalable Robust Authentication Protocol for Secure Vehicular Communications (2010, background): “The sign-cryption scheme should also satisfy the ciphertext anonymity property that is defined by Boyen [27].”
- Improved Identity-Based Signcryption (2005, neutral): “From, the fa t that Pr[H-ER℄ + Pr[:H-ER℄ = 1, (7), (8), (10), (11) and (12) we have Adv[B℄ (Pr[H-ER℄ + Pr[:H-ER℄) Pr[:E-ER ^ :S-ER℄ 1 (qs + qd)(q2 + qs) (Pr[H-ER℄ +Pr[:H-ER℄) Pr[:E-ER ^ :S-ER℄ 1 (qs + qd)(q2 + qs) = Pr[:E-ER ^ :S-ER℄ 1 (qs + qd)(q2 + qs) : (13) Finally, by the independen e of E-ER a”
- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles) (2006, methodology): “This was noticed by Boyen [12], who gave an ID-based signcryption with a formalization of sender and recipient anonymity.”