搜索结果: 1-15 共查到“密码学 SETUP”相关记录24条 . 查询时间(0.078 秒)
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...
Anonymous Deniable Identification in Ephemeral Setup & Leakage Scenarios
identification scheme ephemeral secret setting ephemeral secret leakage
2019/4/3
In this paper we concern anonymous identification, where the verifier can check that the user belongs to a given group of users (just like in case of ring signatures), however a transcript of a sessio...
Ring Signatures: Logarithmic-Size, No Setup --- from Standard Assumptions
ring signatures linkable ring signatures standard model
2019/3/1
Ring signatures allow for creating signatures on behalf of an ad hoc group of signers, hiding the true identity of the signer among the group. A natural goal is to construct a ring signature scheme fo...
A threshold signature scheme enables distributed signing among nn players such that any subgroup of size t+1t+1 can sign, whereas any group with tt or fewer players cannot. While there exist previous ...
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...
Setup-Free Secure Search on Encrypted Data: Faster and Post-Processing Free
Secure search Fully homomorphic encryption Randomized algorithms
2019/1/2
We present a novel secure searchsecure search protocol on data and queries encrypted with Fully Homomorphic Encryption (FHE). Our protocol enables organizations (client) to (1) securely upload an unso...
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...
We construct a 4-round multi-party computation protocol for any functionality, which is secure against a malicious adversary. Our protocol relies on the sub-exponential hardness of the Learning with E...
Composable Adaptive Secure Protocols without Setup under Polytime Assumptions
UC Security Adaptive Secure Computation Coin-Tossing
2016/12/10
All previous constructions of general multiparty computation protocols that are secure against adaptive corruptions in the concurrent setting either require some form of setup or non-standard assumpti...
We present a topology-based key setup protocol (ToBKeS)
to facilitate the plug and play deployment of cryptography, in networks
with known topology. This protocol uses the topology to authenticate
...
SETUP in Secret Sharing Schemes using Random Values
Secret Sharing SETUP Black-Box Cryptography
2016/1/25
Secret sharing schemes divide a secret among multiple participants
so that only authorized subsets of parties can reconstruct it. We
show that SETUP (Secretly Embedded Trapdoor with Universal Protec...