搜索结果: 1-10 共查到“军事学 Trusted Setup”相关记录10条 . 查询时间(0.062 秒)
Bootstrapping Consensus Without Trusted Setup: Fully Asynchronous Distributed Key Generation
threshold cryptography distributed cryptography asynchronous consensus
2019/9/16
In this paper, we present the first fully asynchronous distributed key generation (ADKG) algorithm as well as the first distributed key generation algorithm that can create keys with a dual (f,2f+1)&#...
Halo: Recursive Proof Composition without a Trusted Setup
zero knowledge elliptic curve cryptosystem
2019/9/16
Non-interactive proofs of knowledge allow us to publicly demonstrate the faithful execution of arbitrary computations. SNARKs have the additional property of succinctness, meaning that the proofs are ...
Omniring: Scaling Up Private Payments Without Trusted Setup - Formal Foundations and Constructions of Ring Confidential Transactions with Log-size Proofs
Ring Confidential Transactions Log-size Proofs
2019/5/31
Monero is the largest cryptocurrency with built-in cryptographic privacy features. The transactions are authenticated using spend proofs, which provide a certain level of anonymity by hiding the sourc...
Spartan: Efficient and general-purpose zkSNARKs without trusted setup
zkSNARKs transparent zkSNARKs SNARKs
2019/5/23
This paper describes a new public coin, succinct interactive zero-knowledge argument for NP under standard cryptographic hardness assumptions—without requiring a trusted setup. In particular, our argu...
Efficient Non-Interactive Zero-Knowledge Proofs in Cross-Domains without Trusted Setup
public-key cryptography zero knowledge
2019/1/26
With the recent emergence of efficient zero-knowledge (ZK) proofs for general circuits, while efficient zero-knowledge proofs of algebraic statements have existed for decades, a natural challenge aros...
Doubly-efficient zkSNARKs without trusted setup
zero knowledge succinct arguments computationally-sound proofs
2017/11/28
Our argument is public coin, so we apply the Fiat-Shamir heuristic to produce a zero-knowledge succinct non-interactive argument of knowledge (zkSNARK), which we call Hyrax. We evaluate Hyrax on three...
A Unified Approach to Constructing Black-box UC Protocols in Trusted Setup Models
secure computation black-box constructions
2017/9/28
We present a unified framework for obtaining black-box constructions of Universal Composable (UC) protocol in trusted setup models. Our result is analogous to the unified framework of Lin, Pass, and V...
Universal Composability from Essentially Any Trusted Setup
foundations / universal composition multi-party computation
2012/3/28
It is impossible to securely carry out general multi-party computation in arbitrary network contexts like the Internet, unless protocols have access to some trusted setup. In this work we classify the...
Universal Composability from Essentially Any Trusted Setup
foundations / universal composition multi-party computation
2011/6/9
It is impossible to securely carry out general multi-party computation in arbitrary network contexts like the Internet, unless protocols have access to some trusted setup. In this work we classify the...
New Notions of Security:Achieving Universal Composability without Trusted Setup
Security Universal Composability Trusted Setup
2009/3/27
We propose a modification to the framework of Universally Composable (UC) security [3]. Our new
notion, involves comparing the protocol executions with an ideal execution involving ideal functionalit...