搜索结果: 1-12 共查到“密码学 interactive proofs”相关记录12条 . 查询时间(0.062 秒)
Decentralized Multi-authority Anonymous Authentication for Global Identities with Non-interactive Proofs
anonymous authentication attribute collusion attack
2019/6/14
We propose a decentralized multi-authority anonymous authentication scheme in which a prover and a verifier are non-interactive. We give two security definitions; resistance against collusion attacks ...
In multi-prover interactive proofs, the verifier interrogates the provers and attempts to steal their knowledge. Other than that, the verifier's role has not been studied. Augmentation of the provers ...
Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs
quasi-optimal SNARGs linear MIPs linear PCPs
2018/2/8
This work gives the first quasi-optimal SNARG for Boolean circuit satisfiability from a concrete cryptographic assumption. Our construction takes a two-step approach. The first is an information-theor...
New Perspectives on Multi-Prover Interactive Proofs
New Perspectives Multi-Prover Interactive Proofs
2018/1/19
The existing multi-prover interactive proof framework suffers from incompleteness in terms of soundness and zero-knowledge that is not completely addressed in the literature. The problem is that the e...
Blockchain protocols such as bitcoin provide decentralized consensus mechanisms based on proof-of-work (PoW). In this work we introduce and instantiate a new primitive for blockchain protocols called ...
Multi-Prover Interactive Proofs: Unsound Foundations
cryptographic protocols Zero-Knowledge
2017/3/9
Several Multi-Prover Interactive Proofs (MIPs) found in the literature contain proofs of soundness that are lacking. This was first observed by Crépeau, Salvail, Simard and Tapp who defined a notion o...
Interactive Proofs under Continual Memory Leakage
Continual Leakage Zero Knowledge Rerandomizable NIZKs
2016/1/7
We consider the task of constructing interactive proofs for NP which can provide meaningful security for a prover even in the presence of continual memory leakage. We imagine a setting where an advers...
We consider interactive proof systems over adversarial communication channels. We show
that the seminal result that IP = PSPACE still holds when the communication channel is
malicious, allowing even...
Time-Optimal Interactive Proofs for Circuit Evaluation
interactive proofs verifiable computation
2014/3/12
Several research teams have recently been working toward the development of practical general-purpose protocols for verifiable computation. These protocols enable a computationally weak verifier to of...
Succinct Non-Interactive Arguments via Linear Interactive Proofs
foundations / interactive proofs probabilistically-checkable proofs
2013/2/21
\emph{Succinct non-interactive arguments} (SNARGs) enable verifying NP statements with lower complexity than required for classical NP verification. Traditionally, the focus has been on minimizing the...
Additive Proofs of Knowledge - A New Notion For Non-Interactive Proofs
Additive Proofs of Knowledge New Notion Non-Interactive Proofs
2009/3/10
In this paper, we study the opacity property of verifiably encrypted signatures (VES) of Boneh
et al. (proposed in Eurocrypt 2003). Informally, opacity implies that although some given aggregate sign...
We present two universally composable and practical protocols
by which a dealer can, verifiably and non-interactively, secret-share
an integer among a set of players. Moreover, at small extra cost ...