Predicate signatures from pair encodings via dual system proof technique
Recently, Attrapadung (Eurocrypt 2014) proposed a generic framework for fully (adaptively) secure predicate encryption (PE) based on a new primitive, called pair encodings. The author shows that if the underlying pair encoding scheme is either perfectly secure or computationally (doubly-selectively)...
Main Authors: | Nandi Mridul, Pandit Tapas |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2019-10-01
|
Series: | Journal of Mathematical Cryptology |
Subjects: | |
Online Access: | https://doi.org/10.1515/jmc-2017-0007 |
Similar Items
-
On the security of joint signature and encryption revisited
by: Nandi Mridul, et al.
Published: (2016-12-01) -
Towards efficient private distributed computation on unbounded input streams
by: Dolev Shlomi, et al.
Published: (2015-06-01) -
The circulant hash revisited
by: Araujo Filipe, et al.
Published: (2020-12-01) -
Converting pairing-based cryptosystems from composite to prime order setting – A comparative analysis
by: Chatterjee Sanjit, et al.
Published: (2018-09-01) -
Optimal codes from Fibonacci polynomials and secret sharing schemes
by: Mehmet E. Koroglu, et al.
Published: (2017-05-01)