Information-theoretically secure oblivious polynomial evaluation in the commodity-based model (original) (raw)
Related papers
Secure Multiparty Computation via Oblivious Polynomial Evaluation
Theory and Practice of Cryptography Solutions for Secure Information Systems, 2013
Efficient Concurrent Oblivious Transfer in Super-Polynomial-Simulation Security
Lecture Notes in Computer Science, 2012
On Unconditionally Secure Distributed Oblivious Transfer
Journal of Cryptology, 2007
Secure Multiparty Overall Mean Computation via Oblivious Polynomial Evaluation
… of Information and Networks: Proceedings of …, 2008
New Results on Unconditionally Secure Distributed Oblivious Transfer
Lecture Notes in Computer Science, 2003
Constant-round secure two-party computation from a linear number of oblivious transfer
Partial Fairness in Secure Two-Party Computation
2012
Lecture Notes in Computer Science, 2009
Oblivious decision program evaluation
IET Information Security, 2013
Oblivious Transfer and n-Variate Linear Function Evaluation
Lecture Notes in Computer Science, 2011
Constant-Round Concurrent Zero-Knowledge in Super-Polynomial Simulation Security
Committed Oblivious Transfer and Private Multi-Party Computation
Lecture Notes in Computer Science, 1995
On Bringer-Chabanne EPIR Protocol for Polynomial Evaluation
2016
Information-Theoretic Conditions for Two-Party Secure Function Evaluation
Lecture Notes in Computer Science, 2006
On the Bringer–Chabanne EPIR protocol for polynomial evaluation
Journal of Mathematical Cryptology, 2012
Weakening Security Assumptions and Oblivious Transfer (Abstract)
International Cryptology Conference, 1988
Oblivious Transfer and Linear Functions
2006
Communication-efficient distributed oblivious transfer
Journal of Computer and System Sciences, 2012
Obtaining Efficient Fully Simulatable Oblivious Transfer from General Assumptions
Anais do XXI Simpósio Brasileiro de Segurança da Informação e de Sistemas Computacionais (SBSeg 2011)
Strong Conditional Oblivious Transfer and Computing on Intervals
Lecture Notes in Computer Science, 2004
Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications
Lecture Notes in Computer Science, 2011
Multi-party computation with conversion of secret sharing
Designs, Codes and Cryptography, 2011
Efficient Unconditional Oblivious Transfer From Almost Any Noisy Channel
Security in Communication Networks, 2005
Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
Efficient Adaptively Secure Zero-Knowledge from Garbled Circuits
IACR Cryptol. ePrint Arch., 2018
Secure Two-Party Computation via Leaky Generalized Oblivious Transfer
S.: Efficient unconditional oblivious transfer from almost any noisy channel
2004
Secrecy of cryptographic protocols under equational theory
Knowledge-Based Systems, 2009
IACR Cryptol. ePrint Arch., 2019
Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security
Efficient and Universally Composable Committed Oblivious Transfer and Applications
Lecture Notes in Computer Science, 2004
Non-Interactive Secure Multiparty Computation
Advances in Cryptology – CRYPTO 2014, 2014
Weakening Security Assumptions and Oblivious Transfer
Lecture Notes in Computer Science
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
computational complexity, 2004
Zero-knowledge from secure multiparty computation
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC '07, 2007