Some key techniques on pairing vector spaces

Authors:
Tatsuaki Okamoto;Katsuyuki Takashima
Affiliations:
NTT, Musashino-shi, Tokyo, Japan;Mitsubishi Electric, Kamakura, Kanagawa, Japan
Venue:
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Year:
2011

Citing 5
Cited 0

Homomorphic Encryption and Signatures from Vector Decomposition

Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Hierarchical Predicate Encryption for Inner-Products

ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Fully secure functional encryption with general relations from the decisional linear assumption

CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Efficient attribute-based signatures for non-monotone predicates in the standard model

PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently we have introduced a new concept on bilinear pairing groups, dual pairing vector spaces (DPVS). Although we have already enjoyed the merits of DPVS in our results, we here explain them more explicitly, especially some key techniques on DPVS.