搜索结果: 1-9 共查到“plain model”相关记录9条 . 查询时间(0.171 秒)
Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model
Plain Model single evaluation
2017/9/28
We consider the problem of constant-round secure two-party computation in the presence of active (malicious) adversaries. We present the first protocol that has only a constant multiplicative communic...
Two-Message Witness Indistinguishability and Secure Computation in the Plain Model from New Assumptions
Zero knowledge Witness indistinguishability Super-polynomial simulation
2017/5/23
We study the feasibility of two-message protocols for secure two-party computation in the plain model, for functionalities that deliver output to one party, with security against malicious parties. Si...
Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model
adaptive security Yao garbled circuits secure computation
2017/1/3
Yao's garbling scheme is one of the basic building blocks of cryptographic protocol design. Originally designed to enable two-message, two-party secure computation, the scheme has been extended in man...
The Feasibility of Outsourced Database Search in the Plain Model
Outsourced Computation Database Search Functionalities Lower Bound
2016/1/7
The problem of securely outsourcing computation to an untrusted server gained momentum with the
recent penetration of cloud computing services. The ultimate goal in this setting is to design efficien...
Positive Results for Concurrently Secure Computation in the Plain Model
cryptographic protocols
2012/6/14
We consider the question of designing concurrently self-composable protocols in the plain model. We first focus on the minimal setting where there is a party \pa which might interact with several othe...
Positive Results for Concurrently Secure Computation in the Plain Model
cryptographic protocols
2012/3/22
We consider the question of designing concurrently self-composable protocols in the plain model. We first focus on the minimal setting where there is a party \pa which might interact with several othe...
Positive Results for Concurrently Secure Computation in the Plain Model
cryptographic protocols
2012/3/21
We consider the question of designing concurrently self-composable protocols in the plain model. We first focus on the minimal setting where there is a party \pa which might interact with several othe...
Protocols for Bounded-Concurrent Secure Two-Party Computation in the Plain Model
secure two-party computation concurrent self composition setup assumptions
2009/4/9
Until recently, most research on the topic of secure computation focused on the stand-alone
model, where a single protocol execution takes place. In this paper, we construct protocols for
the settin...
Universally Composable Blind Signatures in the Plain Model
Blind signatures universal composability
2008/12/30
In the universal composability framework, we define an ideal functionality for blind signatures,
as an alternative to a functionality recently proposed by Fischlin. Fischlin proves that
his function...