Filters








28 Hits in 3.4 sec

Homomorphic Encryption with Access Policies: Characterization and New Constructions [chapter]

Michael Clear, Arthur Hughes, Hitesh Tewari
2013 Lecture Notes in Computer Science  
Our main construction is an XOR-homomorphic IBE scheme based on the quadratic residuosity problem (variant of the Cocks' scheme), which we show to be strongly homomorphic.  ...  Even for the special case of IBE, there are few known group-homomorphic cryptosystems.  ...  Our construction derives from the IBE scheme due to Cocks [27] which has a security reduction to the quadratic residuosity problem.  ... 
doi:10.1007/978-3-642-38553-7_4 fatcat:jdbgof47ozcafhnxpihfzgrmzi

Anonymous IBE from Quadratic Residuosity with Improved Performance [chapter]

Michael Clear, Hitesh Tewari, Ciarán McGoldrick
2014 Lecture Notes in Computer Science  
Identity Based Encryption (IBE) has been constructed from bilinear pairings, lattices and quadratic residuosity.  ...  In this paper, we present a new universallyanonymous IBE scheme based on the quadratic residuosity problem.  ...  Contributions We present a new universally anonymous IBE from quadratic residuosity whose performance closely matches that of the original Cocks scheme.  ... 
doi:10.1007/978-3-319-06734-6_23 fatcat:itbtsrte6vhbhnmvrpwoyv3ksq

A Survey on Homomorphic Encryption Schemes: Theory and Implementation [article]

Abbas Acar, Hidayet Aksu, A. Selcuk Uluagac, Mauro Conti
2017 arXiv   pre-print
First, we present the basics of HE and the details of the well-known Partially Homomorphic Encryption (PHE) and Somewhat Homomorphic Encryption (SWHE), which are important pillars of achieving FHE.  ...  Indeed, Homomorphic Encryption (HE), a special kind of encryption scheme, can address these concerns as it allows any third party to operate on the encrypted data without decrypting it in advance.  ...  Benaloh's proposal was based on the higher residuosity problem.  ... 
arXiv:1704.03578v2 fatcat:zllpjmbaxrfbdnfkxcpoupgkxm

A Survey of Homomorphic Encryption for Outsourced Big Data Computation

2016 KSII Transactions on Internet and Information Systems  
This paper also discusses the challenges of Big Data processing protection and highlights its differences from traditional data protection.  ...  Existing works on homomorphic encryption are technically reviewed and compared in terms of their encryption scheme, homomorphism classification, algorithm design, noise management, and security assumption  ...  This research was supported by a research grant from RUI, Universiti Sains Malaysia (USM) [1001/PKOMP/811334].  ... 
doi:10.3837/tiis.2016.08.022 fatcat:plj6fns2l5b6xilzr3kmr3sw4u

To Allot Secrecy-Safe Association Rules Mining Schema Using FP Tree

S. Suresh
2013 Software Engineering (Science Publishing Group)  
Then it has the homomorphic property E(x1) · E(x2) = (gx1rm1 )(gx2rm2 ) =gx1+x2 (r1r2)m = E(x1 + x2 mod m) · and + denote modular multiplication and addition, respectively.  ...  In order to ensure end to end confidentiality, the framework uses additive homomorphic encryption algorithms. All the count of the conditional FP-tree is merged in this step. Preventing Collusion.  ... 
doi:10.11648/j.se.20130101.11 fatcat:6wodtrd4bvdtrjo624cpt7cadm

Chosen Ciphertext Secure Keyed-Homomorphic Public-Key Encryption [chapter]

Keita Emura, Goichiro Hanaoka, Go Ohtake, Takahiro Matsuda, Shota Yamada
2013 Lecture Notes in Computer Science  
Finally, we consider an identity-based analogue of KH-PKE, called keyed-homomorphic identity-based encryption (KH-IBE) and give its concrete construction from the Gentry IBE scheme.  ...  In addition, the property that anyone can "freely" perform the operation inevitably means that ciphertexts are malleable, and it is well-known that adaptive chosen ciphertext (CCA) security and the homomorphic  ...  Moreover, we also consider an identity-based analogue of KH-PKE, called keyed-homomorphic identitybased encryption (KH-IBE) and give its concrete construction from the Gentry IBE scheme [18] .  ... 
doi:10.1007/978-3-642-36362-7_3 fatcat:4sznckhxkje5xcv6icfyj6trcu

Chosen ciphertext secure keyed-homomorphic public-key cryptosystems

Keita Emura, Goichiro Hanaoka, Koji Nuida, Go Ohtake, Takahiro Matsuda, Shota Yamada
2017 Designs, Codes and Cryptography  
Finally, we consider an identity-based analogue of KH-PKE, called keyed-homomorphic identity-based encryption (KH-IBE) and give its concrete construction from the Gentry IBE scheme.  ...  In addition, the property that anyone can "freely" perform the operation inevitably means that ciphertexts are malleable, and it is well-known that adaptive chosen ciphertext (CCA) security and the homomorphic  ...  Moreover, we also consider an identity-based analogue of KH-PKE, called keyed-homomorphic identitybased encryption (KH-IBE) and give its concrete construction from the Gentry IBE scheme [18] .  ... 
doi:10.1007/s10623-017-0417-6 fatcat:gaxj4f3qgbhhncwz4vlbgnpbxu

A framework for privacy-preserving data sharing in the Smart Grid

Khalid Alharbi, Xiaodong Lin, Jun Shao
2014 2014 IEEE/CIC International Conference on Communications in China (ICCC)  
During my PhD research I learned many new things, and without the people surrounding me I could not enjoy from this period of my life.  ...  [38] ), which are designed from additive homomorphic encryption schemes as well.  ...  prices at peak times due to higher demand from consumers.  ... 
doi:10.1109/iccchina.2014.7008274 dblp:conf/iccchina/AlharbiLS14 fatcat:updxhhwzzveubptzfxg5vkysfe

Octopus: Privacy-Preserving Collaborative Evaluation of Loan Stacking [article]

Yi Li, Kevin Gao, Yitao Duan, Wei Xu
2020 arXiv   pre-print
One of the key steps in the fight against it is the querying of the loan history of a borrower from peer lenders. This is especially important in markets without a trusted credit bureau.  ...  To protect participants privacy and business interests, we want to hide borrower identities and lenders data from the loan originator, while simultaneously verifying that the borrower authorizes the query  ...  We use and to represent homomorphic addition and homomorphic multiplication respectively. For Paillier, E( x 1 ) E(x 2 ) means E(x 1 )E(x 2 ), while E(x 1 ) x 2 means E(x 1 ) x 2 .  ... 
arXiv:2007.02234v1 fatcat:pskdmt2x5rbpjee5pub7e2bu6q

Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$

Zvika Brakerski, Vinod Vaikuntanathan
2014 SIAM journal on computing (Print)  
We deviate from the "squashing paradigm" used in all previous works.  ...  We show that "somewhat homomorphic" encryption can be based on LWE, using a new relinearization technique.  ...  FH-IBE.  ... 
doi:10.1137/120868669 fatcat:dfegiyoylndyjnynxy5rwejzoa

Identity-Based Hierarchical Strongly Key-Insulated Encryption and Its Application [chapter]

Yumiko Hanaoka, Goichiro Hanaoka, Junji Shikata, Hideki Imai
2005 Lecture Notes in Computer Science  
In addition to this, we show method of constructing a partially collusion resistant HIBE from arbitrary IBE in the random oracle model.  ...  By combining both results, we can construct an IBE with non-interactive key update from only an arbitrary IBE.  ...  In addition to our main contribution, we also show a construction of a partially collusion resistant HIBE built from only an arbitrary IBE.  ... 
doi:10.1007/11593447_27 fatcat:wsfk72jiu5fydipssfpsrk7hqy

Hidden Identity-Based Signatures [chapter]

Aggelos Kiayias, Hong-Sheng Zhou
2007 Lecture Notes in Computer Science  
As we argue this makes Hidden-IBS much more attractive than group signatures for a number of applications.  ...  In this paper, we provide a formal model of Hidden-IBS as well as two efficient constructions that realize the new primitive.  ...  The Setup includes SetupUser in addition to SetupIM, SetupOA which are defined as in the Hidden-IBS. Next we describe SetupUser.  ... 
doi:10.1007/978-3-540-77366-5_14 fatcat:vu37jfrvlzg4xo2i3fnna2neaa

Hidden identity-based signatures

A. Kiayias, H.-S. Zhou
2009 IET Information Security  
As we argue this makes Hidden-IBS much more attractive than group signatures for a number of applications.  ...  In this paper, we provide a formal model of Hidden-IBS as well as two efficient constructions that realize the new primitive.  ...  The Setup includes SetupUser in addition to SetupIM, SetupOA which are defined as in the Hidden-IBS. Next we describe SetupUser.  ... 
doi:10.1049/iet-ifs.2007.0151 fatcat:jtkbqxtjpbfrnof7gk6cwl2rcq

Generalized Galbraith's Test: Characterization and Applications to Anonymous IBE Schemes

Paul Cotan, George Teşeleanu
2021 Mathematics  
The first such IBE scheme was constructed by Cocks, and some of its deficiencies were addressed in subsequent works.  ...  The main approaches currently used to construct identity-based encryption (IBE) schemes are based on bilinear mappings, quadratic residues and lattices.  ...  s study, the authors managed to describe a partially homomorphic IBE scheme [12] , and later they improve the scheme such that is also anonymous [7] .  ... 
doi:10.3390/math9111184 fatcat:d2kitnhl55h45ivsqkvq35ghia

Continuous Leakage Resilient Lossy Trapdoor Functions

Sujuan Li, Yi Mu, Mingwu Zhang, Futai Zhang
2017 Information  
Based on the ElGamal-like PKE scheme in vector form [17, 25, 26] , which is additively homomorphic and CPA-secure against continuous leakage, we achieve two proposals of CLR-LTFs under the standard Decisional  ...  Continuous Leakage Resilient LTFs from the DCR Assumption In this section, we show how to construct CLR-LTF under the decisional composite residuosity (DCR) assumption.  ... 
doi:10.3390/info8020038 fatcat:gl4vxso2rrezxaggymxkoj44ae
« Previous Showing results 1 — 15 out of 28 results