Homomorphic encryption and secure comparison
From MaRDI portal
Publication:2379113
DOI10.1504/IJACT.2008.017048zbMath1178.94185WikidataQ120985862 ScholiaQ120985862MaRDI QIDQ2379113
Mikkel Krøigård, Martin Geisler, Ivan B. Damgård
Publication date: 15 January 2009
Published in: International Journal of Applied Cryptography (Search for Journal in Brave)
securitybenchmarksecret sharingMPCprotocolshomomorphic encryptionsecure multiparty computationapplied cryptographyonline auctionssecure integer comparison
Related Items (11)
A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties ⋮ Constant-round client-aided secure comparison protocol ⋮ A Secure and Efficient Protocol for Electronic Treasury Auctions ⋮ Privacy-preserving naive Bayes classifiers secure against the substitution-then-comparison attack ⋮ Private evaluation of a decision tree based on secret sharing ⋮ Cryptanalysis of a privacy-preserving authentication scheme based on private set intersection ⋮ Discrete logarithm based additively homomorphic encryption and secure data aggregation ⋮ Client-Aided Two-Party Secure Interval Test Protocol ⋮ Improved Multiplication Triple Generation over Rings via RLWE-Based AHE ⋮ Trusted computing with addition machines. I ⋮ Secure two-party integer comparison protocol without any third party
This page was built for publication: Homomorphic encryption and secure comparison