Oblivious Polynomial Evaluation

DOI10.1137/S0097539704383633MaRDI QIDQ5470733zbMATH OpenFDO

Authors Moni Naor, Benny Pinkas

Publication date 1 June 2006

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539704383633

zbMATH Keywords

cryptographynoisy polynomial reconstructionsecure computation

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Oblivious transfer and polynomial evaluation
• Oblivious multi-variate polynomial evaluation
• Oblivious evaluation of multivariate polynomials
• Oblivious polynomial evaluation and oblivious neural learning
• Information Security and Privacy

Cited in

(35)

• Verifiable private polynomial evaluation
• Unconditionally secure distributed oblivious polynomial evaluation
• Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
• Group homomorphic encryption: characterizations, impossibility results, and applications
• Privacy-preserving verifiable delegation of polynomial and matrix functions
• Function secret sharing for mixed-mode and fixed-point secure computation
• Blind polynomial evaluation and data trading
• Dynamic universal accumulator with batch update over bilinear groups
• Highly efficient OT-based multiplication protocols
• Oblivious sampling with applications to two-party k-means clustering
• Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions
• Oblivious polynomial evaluation and oblivious neural learning
• Oblivious transfer and polynomial evaluation
• Encryption switching protocols
• Oblivious evaluation of multivariate polynomials
• On constructing homomorphic encryption schemes from coding theory
• On the Bringer-Chabanne EPIR protocol for polynomial evaluation
• Certifying equality with limited interaction
• Efficient multi-party computation: from passive to active security via secure SIMD circuits
• Error-Tolerant Combiners for Oblivious Primitives
• A Highly Scalable RFID Authentication Protocol
• Another Look at Extended Private Information Retrieval Protocols
• Oblivious multi-variate polynomial evaluation
• scientific article; zbMATH DE number 2081076 (Why is no real title available?)
• Making private function evaluation safer, faster, and simpler
• Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
• Augmented oblivious polynomial evaluation protocol and its applications
• Private polynomial commitments and applications to MPC
• Count me in! Extendability for threshold ring signatures
• Amortizing division and exponentiation
• MyOPE: malicious security for oblivious polynomial evaluation
• Generalized oblivious transfer by secret sharing
• The price of active security in cryptographic protocols
• Laconic cryptography with preprocessing
• On the security and privacy of CKKS-based homomorphic evaluation protocols

This page was built for publication: Oblivious Polynomial Evaluation

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