Sciweavers

15 search results - page 1 / 3
» Fully Secure Functional Encryption with General Relations fr...
Sort
View
CRYPTO
2010
Springer
195views Cryptology» more  CRYPTO 2010»
13 years 6 months ago
Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
This paper presents a fully secure functional encryption scheme for a wide class of relations, that are specified by non-monotone access structures combined with inner-product rel...
Tatsuaki Okamoto, Katsuyuki Takashima
CRYPTO
2009
Springer
172views Cryptology» more  CRYPTO 2009»
13 years 11 months ago
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
We present a new methodology for proving security of encryption systems using what we call Dual System Encryption. Our techniques result in fully secure Identity-Based Encryption ...
Brent Waters
CCS
2009
ACM
13 years 9 months ago
Efficient pseudorandom functions from the decisional linear assumption and weaker variants
In this paper, we generalize Naor and Reingold's construction of pseudorandom functions under the DDH Assumption to yield a construction of pseudorandom
Allison B. Lewko, Brent Waters
EUROCRYPT
2012
Springer
11 years 7 months ago
Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
This paper proposes the first inner product encryption (IPE) scheme that is adaptively secure and fully attribute-hiding (attribute-hiding in the sense of the definition by Katz...
Tatsuaki Okamoto, Katsuyuki Takashima
CRYPTO
2011
Springer
235views Cryptology» more  CRYPTO 2011»
12 years 5 months ago
Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting
Deterministic public-key encryption, introduced by Bellare, Boldyreva, and O’Neill (CRYPTO ’07), provides an alternative to randomized public-key encryption in various scenari...
Zvika Brakerski, Gil Segev