Efficient Binary Conversion for Paillier Encrypted Values

DOI10.1007/11761679_31zbMath1140.94370OpenAlexW2160435515MaRDI QIDQ3593115

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)

Related Items (8)

A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties ⋮ Quadratic Error Minimization in a Distributed Environment with Privacy Preserving ⋮ Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems ⋮ Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values ⋮ Leakage-resilient biometric-based remote user authentication with fuzzy extractors ⋮ Function secret sharing for mixed-mode and fixed-point secure computation ⋮ Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation ⋮ Multiparty cardinality testing for threshold private intersection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multi-Authority Secret-Ballot Elections with Linear Work
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• Advances in Cryptology - EUROCRYPT 2004
• Practical Two-Party Computation Based on the Conditional Gate
• Theory of Cryptography
• Theory of Cryptography
• Advances in Cryptology - ASIACRYPT 2003

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