Public-key cryptosystems based on composite degree residuosity classes
Pascal Paillier
- Vol. 1592, pp 223-238
Reads0
Chats0
TLDR
A new trapdoor mechanism is proposed and three encryption schemes are derived : a trapdoor permutation and two homomorphic probabilistic encryption schemes computationally comparable to RSA, which are provably secure under appropriate assumptions in the standard model.Abstract:
This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new trapdoor mechanism and derive from this technique three encryption schemes : a trapdoor permutation and two homomorphic probabilistic encryption schemes computationally comparable to RSA. Our cryptosystems, based on usual modular arithmetics, are provably secure under appropriate assumptions in the standard model.read more
Citations
More filters
Proceedings ArticleDOI
Efficient Privacy-Preserving Matrix Factorization via Fully Homomorphic Encryption: Extended Abstract
TL;DR: This paper proposes the first privacy-preserving matrix factorization using fully homomorphic encryption, which provides a way to obfuscate the number and list of items a user rated without harming the accuracy of recommendation, and additionally protects recommender's tuning parameters for business benefit and allows the recommender to optimize parameters for quality of service.
Proceedings ArticleDOI
PS-TRUST: Provably Secure Solution for Truthful Double Spectrum Auctions
TL;DR: PS-TRUST is the first provably secure solution for spectrum auctions, and besides maintaining the properties of truthfulness and special spectrum reuse of TRUST, achieves provable security against semi-honest adversaries in the sense of cryptography.
Proceedings ArticleDOI
InnerCircle: A parallelizable decentralized privacy-preserving location proximity protocol
TL;DR: InnerCircle is proposed, a novel secure multi-party computation protocol for location privacy, based on partially homomorphic encryption, and it is proved that the protocol is secure in the semi-honest adversary model of Secure Multi-party Computation, and thus guarantees the desired privacy properties.
Proceedings ArticleDOI
SecHOG: Privacy-Preserving Outsourcing Computation of Histogram of Oriented Gradients in the Cloud
TL;DR: This work proposes two novel privacy-preserving HOG outsourcing protocols, by efficiently encrypting image data by somewhat homomorphic encryption (SHE) integrated with single-instruction multiple-data (SIMD), designing a new batched secure comparison protocol, and carefully redesigning every step of HOG to adapt it to the ciphertext domain.
Posted Content
FedLoc: Federated Learning Framework for Data-Driven Cooperative Localization and Location Data Processing
TL;DR: Experimental results show that near centralized data fitting- and prediction performance can be achieved by a set of collaborative mobile users running distributed algorithms.
References
More filters
Journal ArticleDOI
New Directions in Cryptography
TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
Journal ArticleDOI
A method for obtaining digital signatures and public-key cryptosystems
TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
Journal ArticleDOI
A public key cryptosystem and a signature scheme based on discrete logarithms
TL;DR: A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem that relies on the difficulty of computing discrete logarithms over finite fields.
Proceedings ArticleDOI
Random oracles are practical: a paradigm for designing efficient protocols
Mihir Bellare,Phillip Rogaway +1 more
TL;DR: It is argued that the random oracles model—where all parties have access to a public random oracle—provides a bridge between cryptographic theory and cryptographic practice, and yields protocols much more efficient than standard ones while retaining many of the advantages of provable security.