Filters








315 Hits in 3.3 sec

Homomorphic Hashing for Sparse Coefficient Extraction [chapter]

Petteri Kaski, Mikko Koivisto, Jesper Nederlof
2012 Lecture Notes in Computer Science  
We investigate the systematic use of homomorphic hash functions to combine the best of these methods and obtain improved space-efficient algorithms for problems including LINEAR SAT, SET PARTITION, and  ...  Coefficient extraction techniques on the other hand are both space-efficient and parallelisable, but no tools have been available to exploit sparseness.  ...  domain by a homomorphic hash function, and only then perform the actual coefficient extraction.  ... 
doi:10.1007/978-3-642-33293-7_15 fatcat:fc3uzfmcsraj7k7f4bkw3t2r4i

Homomorphic Hashing for Sparse Coefficient Extraction [article]

Petteri Kaski, Mikko Koivisto, Jesper Nederlof
2012 arXiv   pre-print
We investigate the systematic use of homomorphic hash functions to combine the best of these methods and obtain improved space-efficient algorithms for problems including LINEAR SAT, SET PARTITION, and  ...  Coefficient extraction techniques on the other hand are both space-efficient and parallelisable, but no tools have been available to exploit sparseness.  ...  domain by a homomorphic hash function, and only then perform the actual coefficient extraction.  ... 
arXiv:1203.4063v1 fatcat:in5o4y77zrc2boiljz777ybbiq

Communication-Computation Trade-offs in PIR [article]

Asra Ali, Tancrède Lepoint, Sarvar Patel, Mariana Raykova, Phillipp Schoppmann, Karn Seth, Kevin Yeo
2019 IACR Cryptology ePrint Archive  
We further show how to efficiently construct PIR for sparse databases. Our constructions support batched queries, as well as symmetric PIR.  ...  We study the computation and communication costs and their possible trade-offs in various constructions for private information retrieval (PIR), including schemes based on homomorphic encryption and the  ...  New Construction for Sparse PIR.  ... 
dblp:journals/iacr/AliLP0SSY19 fatcat:ce35yaa2e5hqtidepu4vmvbfke

Efficient and secure outsourcing of genomic data storage

João Sá Sousa, Cédric Lefebvre, Zhicong Huang, Jean Louis Raisaro, Carlos Aguilar-Melchor, Marc-Olivier Killijian, Jean-Pierre Hubaux
2017 BMC Medical Genomics  
In order to protect data and query confidentiality from possible leakage, our solution exploits optimal encoding for genomic variants and combines it with homomorphic encryption and private information  ...  Methods: We present a novel privacy-preserving algorithm for fully outsourcing the storage of large genomic data files to a public cloud and enabling researchers to efficiently search for variants of interest  ...  Funding This work was financially supported by EPFL-I&C-LCA #1211-1 fund; funding to pay the Open Access publication charges for this article was provided by the same institution.  ... 
doi:10.1186/s12920-017-0275-0 pmid:28786363 pmcid:PMC5547444 fatcat:yfczyorcq5g6vdxmnjfnwu4xom

P3OI-MELSH: Privacy Protection Target Point of Interest Recommendation Algorithm Based on Multi-Exploring Locality Sensitive Hashing

Desheng Liu, Linna Shan, Lei Wang, Shoulin Yin, Hui Wang, Chaoyang Wang
2021 Frontiers in Neurorobotics  
On the one hand, it reduces the number of hash tables to decrease the memory overhead; On the other hand, the retrieval range on each hash table is increased to reduce the time retrieval overhead.  ...  Considering the data privacy, it is difficult for individuals to share data with others with similar preferences.  ...  For example, for excessively sparse user score data, when co-score projects are very rare, Pearson correlation coefficient is not good to measure similarity, and similarity calculation is not accurate.  ... 
doi:10.3389/fnbot.2021.660304 pmid:33967732 pmcid:PMC8102779 fatcat:byn5itamefdhtbrafusvbeaegq

Secure searching of biomarkers through hybrid homomorphic encryption scheme

Miran Kim, Yongsoo Song, Jung Hee Cheon
2017 BMC Medical Genomics  
Result: Since our method requires a single homomorphic multiplication of hybrid scheme for query computation, it has the advantage over the previous methods in parameter size, computation complexity, and  ...  We are interested in designing a protocol for the secure outsourcing matching problem on encrypted data.  ...  implementations for these important tasks.  ... 
doi:10.1186/s12920-017-0280-3 pmid:28786366 pmcid:PMC5547457 fatcat:q2db6ah6ejevrgxwefcgkrg4ym

Fully Homomorphic Encryption over the Integers with Shorter Public Keys [chapter]

Jean-Sébastien Coron, Avradip Mandal, David Naccache, Mehdi Tibouchi
2011 Lecture Notes in Computer Science  
This simplicity comes at the expense of a public key size inÕ(λ 10 ) which is too large for any practical system.  ...  The DGHV fully homomorphic scheme over the integers. At Eurocrypt 2010, van Dijk, Gentry, Halevi and Vaikuntanathan described a fully homomorphic encryption scheme over the integers [4].  ...  Smart and the CRYPTO referees for helpful comments.  ... 
doi:10.1007/978-3-642-22792-9_28 fatcat:zdkmjyttz5h2jdmzbndugvhcfy

Privacy-Preserving Patient Similarity Learning in a Federated Environment: Development and Analysis

Junghye Lee, Jimeng Sun, Fei Wang, Shuang Wang, Chi-Hyuck Jun, Xiaoqian Jiang
2018 JMIR Medical Informatics  
We also confirmed privacy preservation in similarity search by using homomorphic encryption.  ...  Methods: We proposed a federated patient hashing framework and developed a novel algorithm to learn context-specific hash codes to represent patients across institutions.  ...  of feature vector for p i j f k : k-th hash function d k : dimensionality of the k-th feature type b k : the number of bits of the learned hash codes for the k-th feature type W k : function coefficients  ... 
doi:10.2196/medinform.7744 pmid:29653917 pmcid:PMC5924379 fatcat:i2kjdhs3rrabzmkaegdtj5l6ra

On Extremal Expanding Algebraic Graphs and post-quantum secure delivery of passwords, encryption maps and tools for multivariate digital signatures [article]

Vasyl Ustimenko
2021 IACR Cryptology ePrint Archive  
Correspondents can use the sequence of maps for extracting passwords for one time pads in alphabet K and other symmetric or asymmetric algorithms.  ...  We are looking for their applications to Post Quantum Cryptography.  ...  One can extract special tuples of coefficients of maps gm for their usage for safe delivery of pseudorandom sequences of characters produced by quantum computer.  ... 
dblp:journals/iacr/Ustimenko21a fatcat:rasjnmjqpng3hnnsrcq3yopxmy

From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again

Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer
2012 Proceedings of the 3rd Innovations in Theoretical Computer Science Conference on - ITCS '12  
We formulate a general and relatively natural notion of an extractable collision-resistant hash function (ECRH) and show that, if ECRHs exist, then a modified version of Di Crescenzo and Lipmaa's protocol  ...  is a succinct non-interactive argument for NP.  ...  Eran wishes to thank Shai Halevi for early discussions about using extractable collision resistance as a solution approach, and Daniele Micciancio for a discussion of lattice-based Knowledge of Knapsacks  ... 
doi:10.1145/2090236.2090263 dblp:conf/innovations/BitanskyCCT12 fatcat:2327yyhwrvgoblswnscyjsdtzm

Efficient implementation of ideal lattice-based cryptography

Thomas Pöppelmann
2017 it - Information Technology  
The pseudo-random string returned by the hash function is then used to construct the sparse polynomial c with κ coefficients equal to one and the remaining coefficients set to zero.  ...  From the output of the hash function the sparse polynomial c with κ coefficients equal to one is generated by the GenerateC (see [DDLL13b, Section 4.4] ) routine.  ...  2n coefficients back to the main memory to compute the FFT.  ... 
doi:10.1515/itit-2017-0030 fatcat:mpmamskk25h3lbyshy4rfd4y4y

Compressed Oblivious Encoding for Homomorphically Encrypted Search [article]

Seung Geol Choi, Dana Dachman-Soled, S. Dov Gordon, Linsheng Liu, Arkady Yerukhimovich
2021 arXiv   pre-print
Fully homomorphic encryption (FHE) enables a simple, attractive framework for secure search.  ...  While the search functionality is enabled by the full homomorphism of the encryption scheme. For this reason, researchers have been paying increasing attention to this problem. Since Akavia et al.  ...  For the root finding step of the decoding procedure in PS-COIE, we use an implementation based on SageMath 9.2 [42] .  ... 
arXiv:2109.07708v1 fatcat:rg72kvrmfvbapawtb5eixrdnra

Stable Hash Generation for Efficient Privacy-Preserving Face Identification

Daile Osorio-Roig, Christian Rathgeb, Pawel Drozdowski, Christoph Busch
2021 IEEE Transactions on Biometrics Behavior and Identity Science  
In this work, we propose a privacypreserving face identification system which utilises a Product Quantisation-based hash look-up table for indexing and retrieval of protected face templates.  ...  These face templates are protected through fully homomorphic encryption schemes, thereby guaranteeing high privacy protection of the enrolled subjects.  ...  ., sparse representation, coordinate descent, and block coordinate descent techniques).  ... 
doi:10.1109/tbiom.2021.3100639 fatcat:g6lszbksxneslggvujmnq2le54

Factors of Sparse Polynomials are Sparse [article]

Zeev Dvir, Rafael Mendes de Oliveira
2014 arXiv   pre-print
The authors would like to thank Ilya Volkovich for pointing out a counterexample to this paper's main result in positive characteristic: If F is a field with prime characteristic p, then the polynomial  ...  Acknowledgments The authors would like to thank Joachim von zur Gathen, Erich Kaltofen, Amir Shpilka and Ilya Volkovich for helpful conversations and comments.  ...  Notice that we can use the homomorphism ν I to extract the coefficients of ν(q) (mod p) , since for instance ν I (q)| {1,4} = 2z 4 1 + z 1 is the coefficient of x 1 in ν(q) (mod p) .  ... 
arXiv:1404.4834v2 fatcat:qtaixia6vvfghbowfzrpy6tyfi

A Large-Scale Secure Image Retrieval Method in Cloud Environment

Yanyan Xu, Xiao Zhao, Jiaying Gong
2019 IEEE Access  
Existing secure image retrieval methods generally have some problems such as low retrieval accuracy and low retrieval efficiency, which cannot meet requirements for large-scale image retrieval in cloud  ...  The random sampling method and min-Hash algorithm can not only ensure the security of the search index, but also greatly improve the image retrieval efficiency.  ...  ACKNOWLEDGMENT The authors would like to thank the anonymous reviewers for their helpful and constructive suggestions and comments.  ... 
doi:10.1109/access.2019.2951175 fatcat:q737ps3qmbahtozobfi5mcfh7e
« Previous Showing results 1 — 15 out of 315 results