搜索结果: 1-7 共查到“密码学 sigma protocols”相关记录7条 . 查询时间(0.081 秒)
On sigma protocols with helper for MQ and PKP, fishy signature schemes and more
zero knowledge Post-Quantum digital signatures Multivariate cryptography
2019/5/21
We then remove the helper from the protocol with a "cut-and-choose" protocol and we apply the Fiat-Shamir transform to obtain signature schemes with security proof in the QROM. We show that the result...
Optimally Sound Sigma Protocols Under DCRA
Culpable soundness designated verifier homomorphic encryption
2017/7/24
Given a well-chosen additively homomorphic cryptosystem and a ΣΣ protocol with a linear answer, Damgård, Fazio, and Nicolosi proposed a non-interactive designated-verifier zero knowledge argument...
Online/Offline OR Composition of Sigma Protocols
Sigma protocols round efficiency adaptive input
2016/2/24
Proofs of partial knowledge allow a prover to prove knowledge of witnesses for k out of n
instances of NP languages. Cramer, Schoenmakers and Damgⅹard [CDS94] provided an efficient
construction of a...
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...
In [CDS94] Cramer, Damgⅹard and Schoenmakers (CDS) devise an OR-composition technique
for ヒ-protocols that allows to construct highly-efficient proofs for compound statements. Since
then, such techn...
Hash Functions from Sigma Protocols and Improvements to VSH
Hash Functions Sigma Protocols VSH
2009/6/9
We present a general way to get a provably collision-resistant hash function from any (suitable)
-protocol. This enables us to both get new designs and to unify and improve previous work. In
the fi...