搜索结果: 1-15 共查到“Same Coin”相关记录46条 . 查询时间(0.046 秒)
旋涡星系最显著的观测特征就是包含精美的旋臂结构（如图1：风车星系M101）。旋臂的结构特征包含了旋涡星系形成和演化过程中的众多未解之谜。今天，我们有足够的证据表明，银河系是一个包含着多条旋臂结构的巨型旋涡星系。但是，由于太阳身处银河系的中心盘面上，银盘上众多气体和尘埃的消光效应使得银河系旋臂结构性质的测量困难重重。
A Coin-Free Oracle-Based Augmented Black Box Framework
Black Box Construction Zero-Knowledge Proof NIZK
2019/7/25
After the work of Impagliazzo and Rudich (STOC, 1989), the black box framework has become one of the main research domain of cryptography. However black box techniques say nothing about non-black box ...
Estimating Gaps in Martingales and Applications to Coin-Tossing: Constructions and Hardness
information theory foundations distributed cryptography
2019/7/8
Consider the representative task of designing a distributed coin-tossing protocol for nn processors such that the probability of heads is X0∈[0,1]X0∈[0,1], and an adversary can reset one processor to ...
MixEth: efficient, trustless coin mixing service for Ethereum
Cryptography Verifiable shuffle Anonymity
2019/4/3
Coin mixing is a prevalent privacy-enhancing technology for cryptocurrency users. In this paper, we present MixEth, which is a trustless coin mixing service for Turing-complete blockchains. MixEth doe...
Coin toss has been extensively studied in the cryptography literature, and the well-accepted notion of fairness (henceforth called strong fairness) requires that a corrupt coalition cannot cause non-n...
A two-party coin-flipping protocol is ϵϵ-fair if no efficient adversary can bias the output of the honest party (who always outputs a bit, even if the other party aborts) by more than
...
Another coin bites the dust: An analysis of dust in UTXO based cryptocurrencies
blockchain UTXO Bitcoin
2018/5/28
Unspent Transaction Outputs (UTXOs) are the internal mechanism used in many cryp- tocurrencies to represent coins. Such representation has some clear benefits, but also entails some complexities that,...
Two Sides of the Same Coin: Counting and Enumerating Keys Post Side-Channel Attacks Revisited
implementation side channels
2018/1/12
Motivated by the need to assess the concrete security of a device after a side channel attack, there has been a flurry of recent work designing both key rank and key enumeration algorithms. Two main c...
Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds
delayed-input protocols non-malleable zero knowledge multi-party coin tossing
2017/9/26
4-round non-malleable zero knowledge (NMZK): Goyal et al. in FOCS 2014 showed the first 4-round one-one NMZK argument from one-way functions (OWFs). Their construction requires the prover to know the ...
Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious
coin-tossing coin-flipping protocols
2016/12/10
Recently, in a breakthrough result, Haitner and Tsfadia [STOC 2014] constructed an O(log3(r)/r)O(log3(r)/r)-fair (almost optimal) three-party coin-tossing protocol. Their work brings forth a co...
One-out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
Sigma-protocol zero-knowledge disjunctive proof
2016/1/7
We construct a 3-move public coin special honest verifier zero-knowledge
proof, a so-called Sigma-protocol, for a list of commitments having at least one commitment
that opens to 0. It is not requir...
Public-Coin Differing-Inputs Obfuscation and Its Applications
Program Obfuscation Differing Inputs Obfuscation Functional Encryption
2016/1/5
Differing inputs obfuscation (diO) is a strengthening of indistinguishability obfuscation (iO) that
has recently found applications to improving the efficiency and generality of obfuscation, function...
Tight Parallel Repetition Theorems for Public-Coin Arguments using KL-divergence
parallel repetition public coin interactive arguments
2016/1/5
We present a new and conceptually simpler proof of a tight
parallel-repetition theorem for public-coin arguments [Pass-Venkitasubramaniam,
STOC’07], [H˚astad et al, TCC’10], [Chung-Liu, TCC’10]...
Adaptively Secure Coin-Flipping, Revisited
coin-flipping full-information adaptive adversary
2016/1/3
The full-information model was introduced by Ben-Or and Linial in 1985 to study collective coin-flipping: the problem of generating a common bounded-bias bit in a network of n players with t=t(n) faul...
Let A be a subset of the integers and let Snbe the number of heads in
n tosses of a p coin. If limn,, P(SnE A) exists for some p then the limit
exists for all p and does not depend on p. The relat...