Dense Probabilistic Encryption

By Josh Benaloh. 1999

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

A Review of Homomorphic Encryption Libraries for Secure Computation (2018, background): “Partially Homomorphic Encryption (PHE) schemes such as [9,10,11,12,13,14,15,16,17,18,19] allow only one type of operation any number of times - either addition or multiplication on encrypted data as compared to Somewhat Homomorphic schemes that support both.”
Efficient Private Statistics with Succinct Sketches (2015, methodology): “ch. For this application, we build on privacy-preserving data aggregation based on threshold public-key encryption, specifically, an Additively Homomorphic Elliptic-Curve variant of El Gamal (AH-ECC) [7], summarized below. This allows us to seamlessly tolerate missing contributions – following an ap”
A Survey on Homomorphic Encryption Schemes (2017, background): “which are the ﬁrst stepping stones for FHE schemes. 3.1. Partially Homomorphic Encryption Schemes There are several useful PHE examples [Rivest et al. 1978b; Goldwasser and Micali 1982; ElGamal 1985; Benaloh 1994; Naccache and Stern 1998; Okamoto and Uchiyama 1998; Paillier 1999; Damgård and Jurik 2”
Concealed Data Aggregation for Reverse Multicast Traffic in Sensor Networks: Encryption, Key Distribution, and Routing Adaptation (2006, methodology): “Other PHs are the Naccache- Stern public key encryption function [26], encryption transformations proposed by Benaloh [4], Lipton and Sander [22], and Domingo-Ferrer [34].”
Protocols for Secure Remote Database Access with Approximate Matching (2001, background): “Such systems are called homomorphic cryptosystems and examples include the systems by Benaloh [4], Naccache and Stern [25], Okamoto and Uchiyama [27], and Paillier [28].”
Security and Privacy Issues in Deep Learning (2018, background): “Homomorphic cryptosystems in early stages were partial homomorphic cryptosystems [41, 42, 43, 44], that showed either additive or multiplicative homomorphism [45].”
Non-interactive cryptocomputing for NC/sup 1/ (1999, methodology): “The Goldwasser-Micali scheme and the Benaloh scheme [6] (see also [29]) give us via Chinese Remaindering homomorphic schemes using Abelian groups of smooth order.”
Privacy-preserving cooperative statistical analysis (2001, background): “Many such systems exist, and examples include the systems by Benaloh [3], Naccache and Stern [9], Okamoto and Uchiyama [11], Paillier [12], to mention a few.”
PrivEx: Private Collection of Traffic Statistics for Anonymous Communication Networks (2014, methodology): “[5] The DC will check the zero-knowledge proof, and when it observes a connection to, say, Wikipedia, will multiply into its count not E A ( r ; 1) , as above, but rather c V c , where the product is over those countries c that censor Wikipedia.”
Secret charing vs. encryption-based techniques for privacy preserving data mining (2007, unknown): “The natural extension of the GM cryptosystem is the Benaloh cryptosystem [7], which allows the encryption of larger block sizes at a time.”
Secure function evaluation based on secret sharing and homomorphic encryption (2009, unknown): “cryptosystem [9] and the Benaloh cryptosystem[10].”
Homomorphic Signature Schemes (2002, background): “Goldwasser-Micali encryption takes the form of a group homomorphism Z/2Z → (Z/nZ) [17], and others have proposed a number of other public-key encryption schemes that have various useful homomorphic properties [15, 8, 22, 20].”