MyOPE: malicious security for oblivious polynomial evaluation

DOI10.1007/978-3-031-14791-3_29MaRDI QIDQ6134853zbMATH OpenOpenAlexFDO

Authors Malika Izabachène, Anca Nitulescu, Paola de Perthuis, David Pointcheval

Publication date 25 July 2023

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

Full work available at URL https://doi.org/10.1007/978-3-031-14791-3_29

zbMATH Keywords

malicious senderspoly-logarithmic communication complexity

Mathematics Subject Classification ID

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

Recommendations

• Verifiable private polynomial evaluation
• Oblivious Polynomial Evaluation
• Oblivious multi-variate polynomial evaluation
• An Efficient and Provably Secure Private Polynomial Evaluation Scheme
• scientific article; zbMATH DE number 2081076

Cites work

• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 176566 (Why is no real title available?)
• scientific article; zbMATH DE number 2081076 (Why is no real title available?)
• scientific article; zbMATH DE number 1759770 (Why is no real title available?)
• scientific article; zbMATH DE number 1418291 (Why is no real title available?)
• A full RNS variant of FV like somewhat homomorphic encryption schemes
• A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
• Augmented oblivious polynomial evaluation protocol and its applications
• Better key sizes (and attacks) for LWE-based encryption
• Boosting verifiable computation on encrypted data
• Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\)
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Flexible and efficient verifiable computation on encrypted data
• Fully homomorphic encryption using ideal lattices
• Linearly homomorphic encryption from \(\mathsf {DDH}\)
• MyOPE: malicious security for oblivious polynomial evaluation
• Noisy polynomial interpolation and noisy Chinese remaindering
• Non-interactive verifiable computing: outsourcing computation to untrusted workers
• Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
• Oblivious transfer and polynomial evaluation
• On the concrete hardness of learning with errors
• PSI from PaXoS: fast, malicious private set intersection
• Proofs for inner pairing products and applications
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Quadratic span programs and succinct NIZKs without PCPs
• Recursive proof composition from accumulation schemes
• Succinct non-interactive arguments via linear interactive proofs
• Updateable Inner Product Argument with Logarithmic Verifier and Applications

Cited in

(3)

• Credibility in private set membership
• Verifiable private polynomial evaluation
• MyOPE: malicious security for oblivious polynomial evaluation

This page was built for publication: MyOPE: malicious security for oblivious polynomial evaluation

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