搜索结果: 31-45 共查到“军事学 Zero-knowledge”相关记录198条 . 查询时间(0.12 秒)
Proving the correct execution of concurrent services in zero-knowledge
zero knowledge verifiable state machines concurrent services
2018/11/9
This paper introduces Spice, a system for building verifiable state machines (VSMs). A VSM is a request-processing service that produces proofs establishing that requests were executed correctly accor...
Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations
One-way permutations zero-knowledge arguments black-box constructions
2018/11/8
In this paper, we revisit the round complexity of designing zero-knowledge (ZK) arguments via a black-box construction from minimal assumptions. Our main result implements a 4-round ZK argument for an...
Lattice-Based Zero-Knowledge Arguments for Integer Relations
Lattice-based cryptography zero-knowledge arguments integer relations
2018/8/2
We provide lattice-based protocols allowing to prove relations among committed integers. While the most general zero-knowledge proof techniques can handle arithmetic circuits in the lattice setting, a...
DIZK: A Distributed Zero Knowledge Proof System
zero knowledge proofs cluster computing SNARKs
2018/7/20
Recently there has been much academic and industrial interest in practical implementations of *zero knowledge proofs*. These techniques allow a party to *prove* to another party that a given statement...
One-Message Zero Knowledge and Non-Malleable Commitments
Zero-Knowledge Non-Malleable-Commitments Concurrency
2018/6/25
We introduce a new notion of one-message zero-knowledge (1ZK) arguments that satisfy a weak soundness guarantee — the number of false statements that a polynomial-time non-uniform adversary can convin...
From Laconic Zero-Knowledge to Public-Key Cryptography
Public Key Cryptography zero knowledge
2018/6/5
Since its inception, public-key encryption (PKE) has been one of the main cornerstones of cryptography. A central goal in cryptographic research is to understand the foundations of public-key encrypti...
Non-Interactive Zero-Knowledge Proofs for Composite Statements
Non-interactive zero-knowledge sigma protocols SNARK
2018/6/5
The two most common ways to design non-interactive zero-knowledge (NIZK) proofs are based on Sigma protocols and QAP-based SNARKs. The former is highly efficient for proving algebraic statements while...
Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits
Zero-Knowledge Arithmetic Circuits Sub-linear proofs
2018/6/5
We propose the first zero-knowledge argument with sub-linear communication complexity for arithmetic circuit satisfiability over a prime pp whose security is based on the hardness of the short integer...
Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures
zero-knowledge proofs signatures
2018/5/28
Recent work, including ZKBoo, ZKB++, and Ligero, has developed efficient non-interactive zero-knowledge proofs of knowledge (NIZKPoKs) for arbitrary Boolean circuits based on symmetric- key primitives...
A secure end-to-end verifiable e-voting system using zero knowledge based blockchain
E-voting Blockchain Direct Record Electronic Authentication
2018/5/22
In this paper, we present a cryptographic technique for an authenticated, end-to-end verifiable and secret ballot election. Voters should receive assurance that their vote is cast as intended, recorde...
We consider natural ways to extend the notion of Zero-Knowledge (ZK) Proofs beyond decision problems. Specifically, we consider search problems, and define zero-knowledge proofs in this context as int...
Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution
Zero-knowledge proofs succinct arguments of knowledge TinyRAM
2018/5/2
There have been tremendous advances in reducing interaction, communication and verification time in zero-knowledge proofs but it remains an important challenge to make the prover efficient. We constru...
A Note On Groth-Ostrovsky-Sahai Non-Interactive Zero-Knowledge Proof System
Non-interactive zero-knowledge proof bilinear groups with composite order subgroup decision problem
2018/4/10
In 2006, Groth, Ostrovsky and Sahai designed one non-interactive zero-knowledge (NIZK) proof system [new version, J. ACM, 59(3), 1-35, 2012] for plaintext being zero or one using bilinear groups with ...
Non-interactive zero-knowledge (NIZK) is a fundamental primitive that is widely used in the construction of cryptographic schemes and protocols. Despite this, general purpose constructions of NIZK pro...
An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge
statistical zero-knowledge honest-verifier statistical zero-knowledge instance-dependent commitment schemes
2018/3/6
We present an unconditional transformation from any honest-verifier statistical zero-knowledge (HVSZK) protocol to standard SZK that preserves round complexity and efficiency of both the verifier and ...