搜索结果: 1-8 共查到“军事学 CRS”相关记录8条 . 查询时间(0.14 秒)
Zero-knowledge SNARKs (zk-SNARKs) have recently found various applications in verifiable computation and blockchain applications (Zerocash), but unfortunately they rely on a common reference string (C...
Multikey fully homomorphic encryption (MFHE) allows homomorphic operations between ciphertexts encrypted under different keys. In applications for secure multiparty computation (MPC)protocols, MFHE ca...
On Adaptively Secure Multiparty Computation with a Short CRS
secure multiparty computation adaptive security round complexity
2016/12/8
In the setting of multiparty computation, a set of mutually distrusting parties wish to securely
compute a joint function of their private inputs. A protocol is adaptively secure if honest parties
m...
Optimal-Rate Non-Committing Encryption in a CRS Model
non-committing encryption adaptive security
2016/5/30
Non-committing encryption (NCE) implements secure channels under adaptive corruptions in situations when
data erasures are not trustworthy. In this paper we are interested in the rate of NCE, i.e. in...
NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
Parameter Subversion CRS
2016/4/15
Motivated by the subversion of ``trusted'' public parameters in mass-surveillance activities, this paper studies the security of NIZKs in the presence of a maliciously chosen common reference string. ...
An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-Programmable Random Oracle
zero knowledge Sigma protocols Fiat-Shamir
2016/1/7
In this short paper, we present a Fiat-Shamir type transform that takes any Sigma protocol
for a relation R and outputs a non-interactive zero-knowledge proof (not of knowledge) for the
associated l...
An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-Programmable Random Oracle
Public-key cryptosystem Multivariate PKC Code-based PKC
2016/1/7
In this short paper, we present a Fiat-Shamir type transform that takes any Sigma protocol
for a relation R and outputs a non-interactive zero-knowledge proof (not of knowledge) for the
associated l...
On Black-Box Complexity of Universally Composable Security in the CRS model
UC Secure Computation Black-Box Constructions Oblivious Transfer
2015/12/30
In this work, we study the intrinsic complexity of black-box Universally Composable (UC) secure computation based on general assumptions. We present a thorough study in various corruption modelings wh...