Back to Results
First PageMeta Content
Finite fields / Cryptographic protocols / Diffie–Hellman problem / Pairing-based cryptography / Hellman / Diffie–Hellman key exchange / Discrete logarithm / Whitfield Diffie / BLS / Cryptography / Abstract algebra / Computational hardness assumptions


Two novel applications of bilinear groups to ABE encryption Riccardo Longo Department of Mathematics, University of Trento, Italy Chiara Marcolla Department of Mathema
Add to Reading List

Document Date: 2014-12-12 11:38:03

Open Document

File Size: 216,85 KB

Share Result on Facebook

Company

G1 / Bilinear Group / General Subgroup / /

/

Facility

University of Trento / /

IndustryTerm

polynomial-time algorithm / probabilistic polynomialtime algorithm / exponential-time algorithms / main mathematical tools / probabilistic polynomial-time algorithm / /

Organization

Department of Mathematics / General Services Administration / Multi Authority / University of Trento / /

Person

Chiara Marcolla / /

Position

hb / /

Product

Franklin / Diffie-Hellman Assumption This / Diffie-Hellman / /

Technology

Encryption / ABE encryption / exponential-time algorithms / cryptography / probabilistic polynomialtime algorithm / probabilistic polynomial-time algorithm / polynomial-time algorithm / /

SocialTag