• No results found

[PDF] Top 20 A Study of Pair Encodings: Predicate Encryption in Prime Order Groups

Has 10000 "A Study of Pair Encodings: Predicate Encryption in Prime Order Groups" found on our website. Below are the top 20 most common "A Study of Pair Encodings: Predicate Encryption in Prime Order Groups".

A  Study  of  Pair  Encodings:  Predicate  Encryption  in  Prime  Order  Groups

A Study of Pair Encodings: Predicate Encryption in Prime Order Groups

... information-theoretic) pair encoding scheme for a predicate R to a fully secure FE scheme for the same predicate in prime-order groups under Matrix Diffie-Hellman assumption [EHK ... See full document

41

On  the  Power  of  Pair  Encodings:  Frameworks  for  Predicate  Cryptographic  Primitives

On the Power of Pair Encodings: Frameworks for Predicate Cryptographic Primitives

... the pair encodings. If the source pair encoding P is perfectly secure, then the dual of P, denoted by D (P) is also perfectly secure ...underlying pair encoding P has the perfect ...secure ... See full document

72

Expressive And Effective Public-Key Searchable  Encryption Scheme Over Encrypted Data Of Cloud Store  In The Prime-Order Groups

Expressive And Effective Public-Key Searchable Encryption Scheme Over Encrypted Data Of Cloud Store In The Prime-Order Groups

... (i.e., predicate or policy) akin to (“Illness = Diabetes” AND (“Age = 30” OR “Weight = 150- 200”)), an information user 1st obtains a trapdoor related to the access structure from the trapdoor generation center so ... See full document

8

Projective  Arithmetic  Functional  Encryption   and  Indistinguishability  Obfuscation  From  Degree-5  Multilinear  Maps

Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation From Degree-5 Multilinear Maps

... slotted encodings that has the same flavor of multilinear maps defined over composite order ...slotted encodings using prime-order multilinear ...composite order multilinear maps ... See full document

58

Adaptively  Secure  Unrestricted  Attribute-Based  Encryption  with  Subset  Difference  Revocation  in  Bilinear  Groups  of  Prime  Order

Adaptively Secure Unrestricted Attribute-Based Encryption with Subset Difference Revocation in Bilinear Groups of Prime Order

... composite order bilin- ear group setting under non-standard ...composite order bilinear groups than a comparable prime order ... See full document

44

Dual  System  Encryption  Framework  in  Prime-Order  Groups

Dual System Encryption Framework in Prime-Order Groups

... bilinear groups were first suggested by ...composite-order groups, namely projecting and canceling pairing, and proposed guidelines for translating schemes in composite-order groups to ... See full document

54

Attribute  Based  Encryption:  Traitor  Tracing,  Revocation   and  Fully  Security  on  Prime  Order  Groups

Attribute Based Encryption: Traitor Tracing, Revocation and Fully Security on Prime Order Groups

... policy) pair (R, A ) would only allow users whose (index, attribute set) pair (k, S) satisfies (k ∈ [N] \ R) AND (S satisfies A ) to ...the encryption algorithm of AugR-CP-ABE as Encrypt A (PP, M, R, ... See full document

40

Adaptively  Simulation-Secure  Attribute-Hiding  Predicate  Encryption

Adaptively Simulation-Secure Attribute-Hiding Predicate Encryption

... secure prime order bilinear groups being only the works of Okamoto and Takashima [OT12a, OT12b, ...expressive predicate classes such as NC 1 under standard computa- tional assumptions could be ... See full document

63

Dual  System  Encryption  via  Predicate  Encodings

Dual System Encryption via Predicate Encodings

... system encryption methodology for building adaptively secure predicate ...system encryption scheme, there are two types of keys and ciphertexts: normal and ...system encryption methodology ... See full document

20

Forward-Secure  Hierarchical  Predicate  Encryption

Forward-Secure Hierarchical Predicate Encryption

... hierarchical predicate encryption (FS-HPE) scheme, for zero-inner-product predicates ...bilinear groups of prime ...in order to account for FS, in a more complex way than in FS-HIBE ... See full document

37

Improved  Dual  System  ABE  in  Prime-Order  Groups  via  Predicate  Encodings

Improved Dual System ABE in Prime-Order Groups via Predicate Encodings

... the predicate and the composite-order scheme (to preserve efficiency), and the analysis for correctness, efficiency and security are more ...composite-order groups do not seem to naturally ... See full document

40

A  New  Encoding  Framework  for  Predicate  Encryption  with  Non-Linear  Structures  in  Prime  Order  Groups

A New Encoding Framework for Predicate Encryption with Non-Linear Structures in Prime Order Groups

... for predicate encryption (PE) in prime order ...attribute-based encryption by allowing PE schemes to have more flexible ...in prime order groups require strong ... See full document

45

Generic  Transformations  of  Predicate  Encodings:  Constructions   and  Applications

Generic Transformations of Predicate Encodings: Constructions and Applications

... so-called predicate en- codings, an information-theoretic primitive inspired from linear secret ...so-called pair encodings and provided computational and information-theoretic security ...of ... See full document

35

Privacy  Preserving  Revocable  Predicate  Encryption  Revisited

Privacy Preserving Revocable Predicate Encryption Revisited

... identity-based encryption (IBE), Boneh and Franklin [8, 9] proposed a revocation method such that an authority regularly issues the secret key of a user for an identity and a current time ... See full document

22

Beyond  the  Limitation  of  Prime-Order  Bilinear  Groups,   and  Round  Optimal  Blind  Signatures

Beyond the Limitation of Prime-Order Bilinear Groups, and Round Optimal Blind Signatures

... the proposed scheme. With this proof, we obtain a round optimal (partially) blind signature scheme (without relying on the random oracle heuristic) based on the decisional linear assumption in the common reference string ... See full document

30

Predicate  Encryption  for  Circuits  from  LWE

Predicate Encryption for Circuits from LWE

... We will be interested in realizing PHPE for functions φ of the form φ(x, y) = g(x, h(y)) for some functions g and h where h may perform arbitrary heavy-weight computation on the public y and g only performs light- weight ... See full document

30

Fully  Private  Revocable  Predicate  Encryption

Fully Private Revocable Predicate Encryption

... Functional Encryption In recent years, asymmetric encryption has experienced a paradigm shift from encryption of secret messages for particular recipients (Public Key Encryption or ... See full document

44

On  the  Impossibility  of  Constructing  Efficient  Key  Encapsulation   and  Programmable  Hash  Functions  in  Prime  Order  Groups

On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups

... In this paper, we discuss the impossibility of constructing CCA secure KEMs in standard prime order groups with low ciphertext overhead. More specifically, as our main result, we show that it is ... See full document

31

Realizing  Chosen  Ciphertext  Security  Generically  in  Attribute-Based  Encryption   and  Predicate  Encryption

Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate Encryption

... particular pseudo random generator. Indeed, this seems rather plausible that ordinary types of PRGs would have it. Alternately, we show how to construct PRGs that provably have this property under either the ... See full document

37

OD characterization of the automorphism groups of simple K3 groups

OD characterization of the automorphism groups of simple K3 groups

... its prime graph has been introduced in (Moghaddamfar et ...non-isomorphic groups H satisfying conditions (1) | G | = | H | and (2) D(G) = ...those groups with connected prime graphs are ... See full document

8

Show all 10000 documents...