Public Key Cryptography - PKC 2006

DOI10.1007/11745853MaRDI QIDQ5898935zbMATH OpenOpenAlexFDO

Authors Payman Mohassel, Matthew Franklin

Publication date 2 May 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

passive adversarypolynomial operationsprivacy-preserving set operationssecure multi-party computationthreshold homomorphic encryption

Mathematics Subject Classification ID

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

Recommendations

• Invertible polynomial representation for private set operations
• Efficient and Secure Evaluation of Multivariate Polynomials and Applications
• Multi-party computation with conversion of secret sharing
• Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
• scientific article; zbMATH DE number 176564

Cited in

(5)

• Invertible polynomial representation for private set operations
• Efficient Disjointness Tests for Private Datasets
• Chosen-ciphertext secure code-based threshold public key encryptions with short ciphertext
• Threshold Niederreiter: chosen-ciphertext security and improved distributed decoding
• Fast secure computations on shared polynomials and applications to private set operations

This page was built for publication: Public Key Cryptography - PKC 2006

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