2010 IEEE International Workshop on Information Forensics and Security 2010
DOI: 10.1109/wifs.2010.5711458
|View full text |Cite
|
Sign up to set email alerts
|

Secure computations on non-integer values

Abstract: In this paper we present for the first time a framework that allows secure two-party computations on approximations of real valued signals. In our solution, we use a quantized logarithmic representation of the signal samples, which enables to represent both very small and very large numbers with bounded relative error. We show that numbers represented in this way can be encrypted using standard homomorphic encryption schemes; furthermore we give protocols that allow to perform all arithmetic operations on such… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 23 publications
(10 citation statements)
references
References 19 publications
0
10
0
Order By: Relevance
“…Multiple algorithms were proposed for computing floating point arithmetic in SMPC [1,16,26,39,47,69] and in homomorphic encryption [22,40]. They were implemented in the SMPC frameworks Sharemind [8], PICCO [69], and ABY [16].…”
Section: Integer To Floating Point Conversionmentioning
confidence: 99%
“…Multiple algorithms were proposed for computing floating point arithmetic in SMPC [1,16,26,39,47,69] and in homomorphic encryption [22,40]. They were implemented in the SMPC frameworks Sharemind [8], PICCO [69], and ABY [16].…”
Section: Integer To Floating Point Conversionmentioning
confidence: 99%
“…A prominent example is the Paillier cryptosystem [15], [16]. One simple illustrative example would be: Let n = pq, and p and q be distinctive prime numbers of sufficient size (1,024-2,048 bits).…”
Section: B Homomorphic Encryption and Smcmentioning
confidence: 99%
“…On the other hand, users can also exchange public information with all other users. In other words, all users are broadcasting their information and receive information from all other users; thus, this type of exchange is also called group information exchange (see [37]) or full information exchange (see [38,39]).…”
Section: Introductionmentioning
confidence: 99%