Oblivious Polynomial Evaluation
From MaRDI portal
Publication:5470733
DOI10.1137/S0097539704383633zbMath1101.94026MaRDI QIDQ5470733
Publication date: 1 June 2006
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Related Items
Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits, Dynamic universal accumulator with batch update over bilinear groups, Certifying equality with limited interaction, Highly efficient OT-based multiplication protocols, Making Private Function Evaluation Safer, Faster, and Simpler, Oblivious sampling with applications to two-party \(k\)-means clustering, Private polynomial commitments and applications to MPC, Count me in! Extendability for threshold ring signatures, Amortizing division and exponentiation, Generalized oblivious transfer by secret sharing, Group homomorphic encryption: characterizations, impossibility results, and applications, Error-Tolerant Combiners for Oblivious Primitives, Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs, Privacy-preserving verifiable delegation of polynomial and matrix functions, A Highly Scalable RFID Authentication Protocol, Function secret sharing for mixed-mode and fixed-point secure computation, Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions, Another Look at Extended Private Information Retrieval Protocols, On Constructing Homomorphic Encryption Schemes from Coding Theory, Encryption Switching Protocols, Blind polynomial evaluation and data trading
