Oblivious transfer and polynomial evaluation

DOI10.1145/301250.301312zbMath1345.68018OpenAlexW2017464959MaRDI QIDQ2819551

Publication date: 29 September 2016

Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/301250.301312

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Data encryption (aspects in computer science) (68P25) Information storage and retrieval of data (68P20) Network protocols (68M12)

Related Items

Efficient set intersection with simulation-based security, Oblivious key-value stores and amplification for private set intersection, Multiparty Proximity Testing with Dishonest Majority from Equality Testing, Privacy-preserving inverse distance weighted interpolation, Reducing elliptic curve logarithms to logarithms in a finite field, Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction, A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations, Quantum oblivious transfer based on entanglement swapping, Actively secure arithmetic computation and VOLE with constant computational overhead, MyOPE: malicious security for oblivious polynomial evaluation, Privacy-enhanced attribute-based private information retrieval, Solutions to the anti-piracy problem in oblivious transfer, Efficient Disjointness Tests for Private Datasets, An Efficient and Provably Secure Private Polynomial Evaluation Scheme, Rate-1 quantum fully homomorphic encryption, Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection, Efficient oblivious transfers with access control, Blind Identity-Based Encryption and Simulatable Oblivious Transfer, Finding smooth integers in short intervals using CRT decoding, Efficient, actively secure MPC with a dishonest majority: a survey, A note on ``Selling multiple secrets to a single buyer, Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs, Finite interval-time transition system for real-time actors, Simpler session-key generation from short random passwords, Oblivious Transfer Is Symmetric, Proving possession of arbitrary secrets while not giving them away: New protocols and a proof in GNY logic, Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries, Application of blind quantum computation to two-party quantum computation, Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries, Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding, Communication-Efficient Private Protocols for Longest Common Subsequence, Private multiparty sampling and approximation of vector combinations, A Highly Scalable RFID Authentication Protocol, Two-Message, Oblivious Evaluation of Cryptographic Functionalities, Oblivious keyword search, Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting, Protecting data privacy in private information retrieval schemes, Oblivious polynomial evaluation and oblivious neural learning, Comments on the `\(m\) out of \(n\) oblivious transfer', Two provably secure \(k\)-out-of-\(n\) oblivious transfer schemes, Efficient pseudorandom correlation generators from ring-LPN, Private set intersection in the internet setting from lightweight oblivious PRF, Augmented Oblivious Polynomial Evaluation Protocol and Its Applications, TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures