MyOPE: malicious security for oblivious polynomial evaluation

DOI10.1007/978-3-031-14791-3_29zbMATH Open1518.94070OpenAlexW3202874560MaRDI QIDQ6134853FDOQ6134853

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

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

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

zbMATH Keywords

malicious senderspoly-logarithmic communication complexity

Mathematics Subject Classification ID

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

Cites Work

• Fully homomorphic encryption using ideal lattices
• Title not available (Why is that?)
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Oblivious transfer and polynomial evaluation
• Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Better Key Sizes (and Attacks) for LWE-Based Encryption
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\)
• Title not available (Why is that?)
• Noisy polynomial interpolation and noisy Chinese remaindering
• Succinct Non-interactive Arguments via Linear Interactive Proofs
• Quadratic Span Programs and Succinct NIZKs without PCPs
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
• Title not available (Why is that?)
• On the concrete hardness of learning with errors
• A full RNS variant of FV like somewhat homomorphic encryption schemes
• Flexible and efficient verifiable computation on encrypted data
• Linearly Homomorphic Encryption from $$\mathsf {DDH}$$
• Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
• Title not available (Why is that?)
• Augmented Oblivious Polynomial Evaluation Protocol and Its Applications
• Boosting verifiable computation on encrypted data
• A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
• PSI from PaXoS: fast, malicious private set intersection
• Recursive proof composition from accumulation schemes
• Title not available (Why is that?)
• Updateable Inner Product Argument with Logarithmic Verifier and Applications
• Proofs for inner pairing products and applications
• MyOPE: malicious security for oblivious polynomial evaluation

Cited In (2)

• Credibility in private set membership
• 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)