A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Order-Revealing Encryption and the Hardness of Private Learning
[article]
2015
arXiv
pre-print
Preserved Fulltext
We show how to use order-revealing encryption to separate computationally efficient PAC learning from efficient (ϵ, δ)-differentially private PAC learning. ...
An order-revealing encryption scheme gives a public procedure by which two ciphertexts can be compared to reveal the ordering of their underlying plaintexts. ...
We now give the proof of Theorem 5. 4. Proof. We construct an example reidentification scheme for ValidSig as follows. ...
arXiv:1505.00388v1
fatcat:vkmd2aw43vhpxd7yccqgtnsqui
Order-Revealing Encryption and the Hardness of Private Learning
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We show how to use order-revealing encryption to separate computationally efficient PAC learning from efficient (ε, δ)-differentially private PAC learning. ...
An order-revealing encryption scheme gives a public procedure by which two ciphertexts can be compared to reveal the ordering of their underlying plaintexts. ...
We now give the proof of Theorem 5. 4. Proof. We construct an example reidentification scheme for ValidSig as follows. ...
doi:10.1007/978-3-662-49096-9_8
fatcat:k7szmsnrjjduzdleo5ljo6abrq
Towards Secure and Practical Location Privacy through Private Equality Testing
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Discrete Logarithm Problem (DLP) is hard in the finite cyclic group generated by a user's private input; in addition, if the two inputs are not equal, neither party will learn anything more than this ...
On the other hand, if Alice and Bob are not in proximity, none of them will learn anything else other than this fact. ...
The authors would like to thank Constantinos Patsakis for indicating an attack in an early version of the PET protocol. ...
doi:10.1007/978-3-319-11257-2_24
fatcat:eyifeqlxjfchpp23pibe346jvq
A SAT-based Public Key Cryptography Scheme
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
A homomorphic public key crypto-scheme based on the Boolean Satisfiability Problem is proposed. The public key is a SAT formula satisfied by the private key. ...
Probabilistic encryption generates functions implied to be false by the public key XOR the message bits. A zero-knowledge proof is used to provide signatures. ...
She rejects any faulty message, regardless of the private key, hence not revealing any information.
ALGORITHMS G ENERATION of key pairs and the encryption algorithm are discussed in this section. ...
arXiv:1507.08094v3
fatcat:q2tzqxsv3rfwjeliwgpe5lxqo4
Honest-Verifier Private Disjointness Testing Without Random Oracles
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
THE FNP PROTOCOL: If any αi = 0, restart the protocol. 4. V encrypts the coefficients of f (x) with a homomorphic encryption scheme and sends the encryptions ci = E(αi) to P. 5. ...
An overview of the Freedman, Nissim, and Pinkas (FNP) protocol Naor and Pinkas [17] , may also be applied to private set operations. ...
The necessary complexity-theoretic assumptions are that it is hard to for a prover to decide whether group elements belong to a particular subgroup of unknown order, and that it is hard to compute elements ...
doi:10.1007/11957454_16
fatcat:hooc2qnkpzduxh3hzjtqfxg7fu
Collusion-resistant outsourcing of private set intersection
2012
Proceedings of the 27th Annual ACM Symposium on Applied Computing - SAC '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Private set intersection enables to compute the set intersection without revealing the non-matching items. ...
The service provider either learns the intersection or remains completely obvious to both input and output -including the intersection's size. ...
The DHS has an interest in not revealing the members of this list and for privacy reasons it would be beneficial to not reveal passengers not contained in the list. ...
doi:10.1145/2245276.2232008
dblp:conf/sac/Kerschbaum12
fatcat:u2ioyd4darbxjbc7ywbydbhsva
Conditional Privacy Using Re-encryption
2008
2008 IFIP International Conference on Network and Parallel Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper proposes, for the first time, the use of re-encryption scheme to improve users privacy in a privacy-enhancing system. ...
Next, this re-encryption key distribution protocol is combined with an existing private credential system to provide a protocol for conditional revocation of private information. ...
Finally, the private key secrecy property states that the value of a 1 is never revealed. ...
doi:10.1109/npc.2008.37
dblp:conf/npc/SuriadiFS08
fatcat:wpjqpipzorhfxnxdwoon226gai
Fast Computation on Encrypted Polynomials and Applications
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
We show that some modifications to the key generation setups and working with variants of the original hardness assumptions one can adapt the existing homomorphic encryption schemes to work in our algorithms ...
The above set of algorithms on encrypted polynomials are useful building blocks for the design of secure computation protocols. ...
A receiver holding an input u ∈ R wants to learn f (u) without learning anything else about the polynomial f and without revealing to the sender any information about u. ...
doi:10.1007/978-3-642-25513-7_17
fatcat:oucrlkclurhmpccntaktlikc6q
Logistic Regression on Homomorphic Encrypted Data at Scale
2019
PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Machine learning on (homomorphic) encrypted data is a cryptographic method for analyzing private and/or sensitive data while keeping privacy. ...
Considering the inefficiency of homomorphic encryption, our result is encouraging and demonstrates the practical feasibility of the logistic regression training on large encrypted data, for the first time ...
Related Work There have been several studies on performing a machine learning without revealing private information. ...
doi:10.1609/aaai.v33i01.33019466
fatcat:lodh5a3h2nh4pd4ejaavx3a54u
Towards Industrial Private AI: A two-tier framework for data and model security
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In this regard, we propose a federated learning and encryption-based private (FLEP) AI framework that provides two-tier security for data and model parameters in an IIoT environment. ...
Experimental results show that the proposed method achieves better encryption quality at the expense of slightly increased execution time. ...
ACKNOWLEDGMENT The authors would like to thank all the contributors who shared data with us for this analysis. ...
arXiv:2107.12806v1
fatcat:5q7eqctm7jd5tk3ouhkka4yvqm
Differentially Private Secure Multi-Party Computation for Federated Learning in Financial Applications
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This adds uncertainty to any attempt to reveal private client data, but also reduces the accuracy of the shared model, limiting the useful scale of privacy-preserving noise. ...
data set, and evaluate it using an open-source simulation platform which we have adapted for the development of federated learning systems. ...
Morgan"), and is not a product of the Research Department of J.P. Morgan. J.P. ...
arXiv:2010.05867v1
fatcat:gtrmrbyeqbcltmcq2viruifezy
Secure anonymous database search
2009
Proceedings of the 2009 ACM workshop on Cloud computing security - CCSW '09
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In order to achieve this in an efficient manner, we make use of Bloom filters [5], definitions of security for deterministic encryption [22] that we adapt and instantiate in the private key setting and ...
There exist many large collections of private data that must be protected on behalf of the entities that hold them or the clients they serve. ...
controlled data sharing without learning any private information of the participants. ...
doi:10.1145/1655008.1655025
dblp:conf/ccs/RaykovaVBM09
fatcat:zzmm3beyybdhda2y56lezvwaly
Federated Learning without Revealing the Decision Boundaries
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
As a remedy, we propose a method to encrypt the images, and have a decryption module hidden inside the model. ...
The entity in charge of federated learning will only have access to a set of complex-valued coefficients, but the model will first decrypt the images and then put them through the convolutional layers. ...
The views expressed in this manuscript are those of the author and do not necessarily reflect the position or policy of the Department of Veterans Affairs or the United States government. ...
arXiv:2103.00695v1
fatcat:queaicaagncupmvgfhule3b4mm
A survey on functional encryption
2021
Advances in Mathematics of Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
<p style='text-indent:20px;'>Functional Encryption (FE) expands traditional public-key encryption in two different ways: it supports fine-grained access control and allows learning a function of the encrypted ...
To our knowledge, this is the first survey that encompasses the entire FE family.</p> ...
We would like to thank Andrea Gelpi, Marco Pedicini, and Michela Iezzi for their interest and valuable discussion on the subject. We also thank the anonymous referee for the helpful comments. ...
doi:10.3934/amc.2021049
fatcat:l3j4d2kfwrbdvk7ff4hrg7leo4
Enabling Comparable Search Over Encrypted Data for IoT with Privacy-Preserving
2019
Computers Materials & Continua
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
To ensure the confidentiality and utilization of these data, industries and companies users encrypt their data and store them in an outsourced party. ...
However, simple adoption of encryption scheme makes the original lose its flexibility and utilization. To address these problems, the searchable encryption scheme is proposed. ...
The authors also gratefully acknowledge the helpful comments and suggestions of the reviewers, which have improved the presentation. ...
doi:10.32604/cmc.2019.05276
fatcat:5poyqk5j4zeefhjzaepqhgmqci
« Previous
Showing results 1 — 15 out of 15,377 results