Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

An Efficient Protocol for Oblivious DFA Evaluation and Applications

Payman Mohassel, Salman Niksefat, Saeed Sadeghian, Babak Sadeghiyan

Published Jan 1, 2012• 57 citations
Publisher
DOI
10.1007/978-3-642-27954-6_25

Related papers

Augmented Oblivious Polynomial Evaluation Protocol and Its Applications

Huafei Zhu, Feng Bao

Lecture notes in computer science•Jan 1, 2005•16 citations

Efficient Protocols for Oblivious Linear Function Evaluation from Ring-LWE

Carsten Baum, Daniel E. Escudero, Alberto Pedrouzo-Ulloa +2 more

Lecture notes in computer science•Jan 1, 2020•20 citations

Distributed Protocols for Oblivious Transfer and Polynomial Evaluation

Aviad Ben Arie, Tamir Tassa

Lecture notes in computer science•Jan 1, 2024•1 citation

Distributed oblivious function evaluation and its applications

Hongda Li, Xiong Yang, Dengguo Feng +1 more

Journal of Computer Science and Technology•Dec 1, 2004•11 citations

Oblivious transfer and polynomial evaluation

Moni Naor, Benny Pinkas B

We describe efficient constructions for two oblivious twoparty computation problems: l-out-of-N Oblivious Transfer &d 'Oblivious Poly&nial Evaluation.The oblivious polynomial evaluation protocol is based on a new intractability assumption which is closely related to noisy polynomial re construction.A direct corollary of the l-out-of-N OT protccol is an efficient transformation of any Private Information Retrieval (PIR) protocol to a Symmetric PIR (SPIR) prc-tow1 without increasing the number of databases.The new construction for l-out-of-N OT is highly efficient -it requires only log N executions of a l-out-of-2 OT protocol.We also present a construction for k-out-of-N OT which is more efficient than k repetitions of l-out-of-N OT.The efficiency of the new OT protocols makes them useful for a variety of applications.These include oblivious sampling which can be used to securely compare the sizes of web search engines, protocols for privately solving the list intersection problem and for mutually authenticated key exchange based on (possibly weak) passwords, and protocols for anonymity preserving web usage metering.

ACM Symposium on Theory of Computing (STOC)•May 1, 1999•633 citations

Secure Deterministic Automata Evaluation: Completeness and Efficient 2-party Protocols

Giovanni Di Crescenzo, Brian Coan, Jonathan Kirsch

Lecture notes in computer science•Jan 1, 2020•0 citations
We describe efficient constructions for two oblivious twoparty computation problems: l-out-of-N Oblivious Transfer &d 'Oblivious Poly&nial Evaluation.The oblivious polynomial evaluation protocol is based on a new intractability assumption which is closely related to noisy polynomial re construction.A direct corollary of the l-out-of-N OT protccol is an efficient transformation of any Private Information Retrieval (PIR) protocol to a Symmetric PIR (SPIR) prc-tow1 without increasing the number of databases.The new construction for l-out-of-N OT is highly efficient -it requires only log N executions of a l-out-of-2 OT protocol.We also present a construction for k-out-of-N OT which is more efficient than k repetitions of l-out-of-N OT.The efficiency of the new OT protocols makes them useful for a variety of applications.These include oblivious sampling which can be used to securely compare the sizes of web search engines, protocols for privately solving the list intersection problem and for mutually authenticated key exchange based on (possibly weak) passwords, and protocols for anonymity preserving web usage metering.