Efficient Binary Conversion for Paillier Encrypted Values

DOI10.1007/11761679_31MaRDI QIDQ3593115zbMATH OpenOpenAlexFDO

Authors Berry Schoenmakers, Pim Tuyls

Publication date 24 September 2007

Published in Advances in Cryptology - EUROCRYPT 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11761679_31

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Sub-linear, secure comparison with two non-colluding parties
• Homomorphic secret sharing from Paillier encryption
• scientific article; zbMATH DE number 1722681
• scientific article; zbMATH DE number 1618044
• Improved primitives for MPC over mixed arithmetic-binary circuits

Cites work

• scientific article; zbMATH DE number 1618044 (Why is no real title available?)
• scientific article; zbMATH DE number 2085426 (Why is no real title available?)
• scientific article; zbMATH DE number 1808209 (Why is no real title available?)
• scientific article; zbMATH DE number 1088224 (Why is no real title available?)
• scientific article; zbMATH DE number 1942435 (Why is no real title available?)
• scientific article; zbMATH DE number 2043334 (Why is no real title available?)
• scientific article; zbMATH DE number 1759349 (Why is no real title available?)
• scientific article; zbMATH DE number 2086698 (Why is no real title available?)
• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• Advances in Cryptology - ASIACRYPT 2003
• Advances in Cryptology - EUROCRYPT 2004
• Efficient proofs that a committed number lies in an interval
• Multi-authority secret-ballot elections with linear work
• Practical Two-Party Computation Based on the Conditional Gate
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Theory of Cryptography
• Theory of Cryptography

Cited in

(9)

• A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties
• Function secret sharing for mixed-mode and fixed-point secure computation
• Trinocchio: privacy-preserving outsourcing by distributed verifiable computation
• An Asymptotically Optimal Method for Converting Bit Encryption to Multi-Bit Encryption
• Multiparty cardinality testing for threshold private intersection
• Quadratic Error Minimization in a Distributed Environment with Privacy Preserving
• Leakage-resilient biometric-based remote user authentication with fuzzy extractors
• Universally verifiable multiparty computation from threshold homomorphic cryptosystems
• Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values

This page was built for publication: Efficient Binary Conversion for Paillier Encrypted Values

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593115)