Filters








701 Hits in 7.5 sec

A Tag Based Encoding: An Efficient Encoding for Predicate Encryption in Prime Order Groups [chapter]

Jongkil Kim, Willy Susilo, Fuchun Guo, Man Ho Au
2016 Lecture Notes in Computer Science  
We introduce a tag based encoding, a new generic framework for modular design of Predicate Encryption (PE) schemes in prime order groups.  ...  Our Contribution We introduce a tag based encoding, a new generic framework for PE schemes in prime order groups.  ...  this paper, we proposed a new encoding framework for PE schemes.  ... 
doi:10.1007/978-3-319-44618-9_1 fatcat:3uwzogze6vayfj54wdy5xzkwya

Dual System Encryption via Predicate Encodings [chapter]

Hoeteck Wee
2014 Lecture Notes in Computer Science  
Moreover, the new schemes often bear a structural resemblance to prior schemes.  ...  Using this notion, we obtain a unifying framework for adaptively-secure public-index predicate encryption schemes for a large class of predicates.  ...  I would like to thank Jie Chen, Kai-Min Chung, Yuval Ishai, Allison Lewko and Vinod Vaikuntanathan for insightful discussions.  ... 
doi:10.1007/978-3-642-54242-8_26 fatcat:4ovr5sr3q5ci5jfc5yxoxzgz3a

Generic Transformations of Predicate Encodings: Constructions and Applications [chapter]

Miguel Ambrona, Gilles Barthe, Benedikt Schmidt
2017 Lecture Notes in Computer Science  
Predicate encodings (Wee, TCC 2014; Chen, Gay, Wee, EU-ROCRYPT 2015), are symmetric primitives that can be used for building predicate encryption schemes.  ...  compare our constructions for boolean combinations of pair encodings with existing similar constructions from pair encodings.  ...  We would also like to thank anonymous reviewers of CRYPTO 2017 for their valuable time and feedback.  ... 
doi:10.1007/978-3-319-63688-7_2 fatcat:3clixushpzbx7m5ppraxrznouy

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

Jie Chen, Romain Gay, Hoeteck Wee
2015 Lecture Notes in Computer Science  
Our framework has three novel components over prior works: (i) new techniques for simulating composite-order groups in primeorder ones, (ii) a refinement of prior encodings framework for dual system ABE  ...  We present a modular framework for the design of efficient adaptively secure attribute-based encryption (ABE) schemes for a large class of predicates under the standard k-Lin assumption in prime-order  ...  We thank Eike Kiltz and Jiaxin Pan for insightful discussions, and the anonymous reviewers for helpful feedback on the write-up.  ... 
doi:10.1007/978-3-662-46803-6_20 fatcat:quoesu72ejap7gwqehrmgqfuja

Functional encryption for computational hiding in prime order groups via pair encodings

Jongkil Kim, Willy Susilo, Fuchun Guo, Man Ho Au
2017 Designs, Codes and Cryptography  
In this work, we aim to address this drawback by proposing a new generalised construction for pair encodings in prime order groups.  ...  Our construction will lead to a number of new FE schemes in prime order groups, which have been previously introduced only in composite order groups by Attrapadung.  ...  Our Contribution Pair encodings in prime order groups. We introduce a new construction in prime order groups for pair encoding schemes.  ... 
doi:10.1007/s10623-017-0327-7 fatcat:r2xuhga7pvac5cptfcx3w3unq4

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

Shashank Agrawal, Melissa Chase
2015 Lecture Notes in Computer Science  
Next we show a generic construction for predicate encryption in prime order groups from our new property; it results in either semi-adaptive or full security depending on the encoding, and gives security  ...  Many of the proposed schemes require composite order pairings, in which the order of the pairing groups is a product of two or more primes; since these schemes require that factoring the group order is  ...  for the same predicate in prime-order groups under Matrix Diffie-Hellman assumption [EHK + 13] (of which DLIN is a special case) with an additional q-type assumption in the case of pair encodings that  ... 
doi:10.1007/978-3-662-49099-0_10 fatcat:c65bakaxwvee3dv2hdr7gzyrku

Predicate signatures from pair encodings via dual system proof technique

Mridul Nandi, Tapas Pandit
2019 Journal of Mathematical Cryptology  
Recently, Attrapadung (Eurocrypt 2014) proposed a generic framework for fully (adaptively) secure predicate encryption (PE) based on a new primitive, called pair encodings.  ...  Thereafter, we instantiate many PS schemes with new results, e.g., the first practical PS schemes for regular languages, the first attribute-based signature (ABS) scheme with constant-size signatures in  ...  Recently, Chen, Gay and Wee [16] and Attrapadung [2] proposed new generic frameworks for achieving adaptively secure ABE in the prime order bilinear groups, which are nothing but the prime order version  ... 
doi:10.1515/jmc-2017-0007 fatcat:bcill2nu6rdjtnfzx22a7pvrzq

Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More [chapter]

Nuttapong Attrapadung
2014 Lecture Notes in Computer Science  
We introduce a new primitive called pair encoding scheme for predicates and show that it implies fully secure functional encryption (for the same predicates) via a generic construction.  ...  Our framework can be regarded as a method for boosting doubly selectively security (of encoding) to full security (of functional encryption).  ...  I would like to thank Michel Abdalla, Takahiro Matsuda, Shota Yamada, and reviewers for their helpful comments on previous versions.  ... 
doi:10.1007/978-3-642-55220-5_31 fatcat:bogsnlvadvb25bga7lm4en3rxa

Simplifying Design and Analysis of Complex Predicate Encryption Schemes [chapter]

Shashank Agrawal, Melissa Chase
2017 Lecture Notes in Computer Science  
In this paper, we propose a new simple property for pair encodings called symbolic security. Proofs that pair encodings satisfy this property are concise and easy to verify.  ...  Finally, we show that any pair encoding satisfying our new property can be used to construct a fully secure predicate encryption scheme.  ...  This leads to an encryption scheme with constant-size ciphertexts in prime-order groups under the k-linear and q-ratio assumptions (Corollary 7.2).  ... 
doi:10.1007/978-3-319-56620-7_22 fatcat:stn6fy6dmve3reaiiwr4jdvnwa

Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products

Jonathan Katz, Amit Sahai, Brent Waters
2012 Journal of Cryptology  
Predicate encryption is a new paradigm generalizing, among other things, identity-based encryption.  ...  In a predicate encryption scheme, secret keys correspond to predicates and ciphertexts are associated with attributes; the secret key SK f corresponding to a predicate f can be used to decrypt a ciphertext  ...  Disclaimer The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the U.S.  ... 
doi:10.1007/s00145-012-9119-4 fatcat:tfnnrjydn5ghxeixusx5mh3nte

CCA-secure Predicate Encryption from Pair Encoding in Prime Order Groups: Generic and Efficient [chapter]

Sanjit Chatterjee, Sayantan Mukherjee, Tapas Pandit
2017 Lecture Notes in Computer Science  
Attrapadung (Eurocrypt 2014) proposed a generic framework called pair encoding to simplify the design and proof of security of CPA-secure predicate encryption (PE) in composite order groups.  ...  This is a significant improvement over conventional approach for CPA-to-CCA conversion in prime order groups. G = G (d+1) 1 and H = G (d+1) 2 respectively. C(·) denotes the cost function.  ...  [6] constructed adaptive CPA-secure predicate encryption schemes in the prime order groups using pair encoding and predicate encoding respectively.  ... 
doi:10.1007/978-3-319-71667-1_5 fatcat:2yyulgz5rvddxeu3e6zztwosse

Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption [chapter]

Allison Lewko, Tatsuaki Okamoto, Amit Sahai, Katsuyuki Takashima, Brent Waters
2010 Lecture Notes in Computer Science  
We present two fully secure functional encryption schemes: a fully secure attribute-based encryption (ABE) scheme and a fully secure (attribute-hiding) predicate encryption (PE) scheme for inner-product  ...  Our predicate encryption scheme is constructed via a new approach on bilinear pairings using the notion of dual pairing vector spaces proposed by Okamoto and Takashima.  ...  We believe that our fully secure system in composite order groups can be transformed to a fully secure system in prime order groups.  ... 
doi:10.1007/978-3-642-13190-5_4 fatcat:sazrfsry65gpzh5bwxm2idfl7q

A multi-authority approach to various predicate encryption types

Tim van de Kamp, Andreas Peter, Willem Jonker
2019 Designs, Codes and Cryptography  
In our decentralized system, anyone can create a new authority and issue decryption keys for their own predicates.  ...  In such multiauthority predicate encryption scheme, ciphertexts are associated with one or more predicates from various authorities and only if a user has a set of decryption keys that evaluates all predicates  ...  The authors additionally thank Bence Bakondi for his help in checking part of the MA-PES proofs and proofreading part of the paper.  ... 
doi:10.1007/s10623-019-00686-x fatcat:zv5smkt7ebd3vcsjwxirifrymu

Expressive Public-Key Encryption with Keyword Search: Generic Construction from KP-ABE and an Efficient Scheme over Prime-Order Groups

Chen Shen, Yang Lu, Jiguo Li
2019 IEEE Access  
INDEX TERMS Searchable encryption, expressive keyword search, key-policy attribute-based encryption, prime-order group.  ...  Furthermore, we present a concrete EPEKS scheme over the prime-order groups. The comparison and experimental results indicate that our scheme is more efficient than the existing EPEKS schemes.  ...  [27] embedded the LSSS structure into keyword search and, for the first time, implemented an EPEKS scheme over the prime-order groups.  ... 
doi:10.1109/access.2019.2961633 fatcat:3yxpijcz3vhspbqwrt6deb4ouy

A Framework for Game-Based Security Proofs [chapter]

David Nowak
2007 Lecture Notes in Computer Science  
We illustrate the use of our framework by proving in a systematic way the so-called semantic security of the encryption scheme Elgamal and its hashed version.  ...  A common way to present security proofs is to structure them as sequences of games. The main contribution of this paper is a framework which refines this approach.  ...  We would like to thank Reynald Affeldt for having directed us to this research area in the first place, and for helpful discussions.  ... 
doi:10.1007/978-3-540-77048-0_25 fatcat:7n77lpauevdufdkr3copl5gpve
« Previous Showing results 1 — 15 out of 701 results