Filters








3,118 Hits in 3.0 sec

Adaptively Secure Coin-Flipping, Revisited [chapter]

Shafi Goldwasser, Yael Tauman Kalai, Sunoo Park
2015 Lecture Notes in Computer Science  
is a symmetric one-round coin-flipping protocol secure against t strongly adaptive corruptions.  ...  We prove that any one-round coin-flipping protocol, regardless of message length, can be secure against at most O( √ n) strong adaptive corruptions.  ...  For any symmetric one-round coin-flipping protocol Π secure against t = t(n) adaptive corruptions, there is a symmetric one-round coin-flipping protocol Π ′ secure against Ω(t) strong adaptive corruptions  ... 
doi:10.1007/978-3-662-47666-6_53 fatcat:yjsf37wkrvh2zgcgyjinezes4i

Adaptively Secure Coin-Flipping, Revisited [article]

Shafi Goldwasser, Yael Tauman Kalai, Sunoo Park
2015 arXiv   pre-print
is a symmetric one-round coin-flipping protocol secure against $t$ strongly adaptive corruptions.  ...  We prove that any one-round coin-flipping protocol, regardless of message length, is secure against at most $\tilde{O}(\sqrt n)$ strong adaptive corruptions.  ...  For any symmetric one-round coin-flipping protocol Π secure against t = t(n) adaptive corruptions, there is a symmetric one-round coin-flipping protocol Π ′ secure against Ω(t) strong adaptive corruptions  ... 
arXiv:1503.01588v2 fatcat:6fj7ze4kczffljicema2sngmoa

Public-Key Cryptography (Dagstuhl Seminar 16371)

Marc Fischlin, Alexander May, David Pointcheval, Tal Rabin, Marc Herbstritt
2017 Dagstuhl Reports  
We analyze our new protocols by presenting a new paradigm for analyzing fairness of coin-flipping protocols.  ...  In particular, we only use non-adaptive-CCA-secure commitments as a building block in our constructions.  ... 
doi:10.4230/dagrep.6.9.46 dblp:journals/dagstuhl-reports/Fischlin0PR16 fatcat:figv27hq4feibl5nzb7snrtm2i

Efficient Random Beacons with Adaptive Security for Ungrindable Blockchains [article]

Aggelos Kiayias, Cristopher Moore, Saad Quader, Alexander Russell
2021 IACR Cryptology ePrint Archive  
The algorithm can tolerate a (1 − 𝜖)∕2 fraction of the 𝑛 players to be controlled by an adaptive adversary that may deviate arbitrarily from the protocol.  ...  The protocol can be directly applied to provide a qualitative improvement in the security of several proof-ofstake blockchain algorithms, rendering them safe from "grinding" attacks.  ...  Recall that our objective is an 𝑛-player beacon protocol with the following properties: (i) it is an iterated single-round coin-flipping protocol; (ii) it is secure against an adaptive adversary who may  ... 
dblp:journals/iacr/KiayiasMQR21 fatcat:5l5aib5kifb6ji3nuvzoc6suu4

Sakai–Ohgishi–Kasahara identity-based non-interactive key exchange revisited and more

Yu Chen, Qiong Huang, Zongyang Zhang
2015 International Journal of Information Security  
The resulting scheme is adaptively secure based on the decisional bilinear Diffie-Hellman inversion (DBDHI) assumption.  ...  On the second place, we investigate the relation between semiadaptive security and adaptive security for IB-NIKE. Somewhat surprisingly, we show that these two notions are polynomially equivalent.  ...  We overcome this difficulty by flipping random coins twice.  ... 
doi:10.1007/s10207-015-0274-0 fatcat:yjz6tfodvbb77cwg2efxjnf3cy

The Exact Round Complexity of Secure Computation [chapter]

Sanjam Garg, Pratyay Mukherjee, Omkant Pandey, Antigoni Polychroniadou
2016 Lecture Notes in Computer Science  
realizing every two-party functionality; -(Multi-party setting): there exists a k -round protocol for securely realizing the multi-party coin-flipping functionality.  ...  We revisit the exact round complexity of secure computation in the multi-party and twoparty settings.  ...  Hence we prove that if the underlying protocol Π ⇔ flip securely realizes simulatable coin-flipping in 3 simultaneous rounds then Π ← → flip securely realizes coin-flipping in 4 non-simultaneous rounds  ... 
doi:10.1007/978-3-662-49896-5_16 fatcat:5frms4m3bbb6xhfaqf3uqaa5qm

Page 2701 of Mathematical Reviews Vol. , Issue 2004c [page]

2004 Mathematical Reviews  
Moreover, electronic money, coin flipping by telephone, bit commitment schemes, verifiable secret sharing schemes and election protocols are all dealt with and specific examples of each type of protocol  ...  Blackburn (4-LNDHB; Egham) 2004c:94106 94A62 68M10 68M14 Desmedt, Yvo (1-FLS-C; Tallahassee, FL); Wang, Yongge Perfectly secure message transmission revisited (extended abstract).  ... 

Clever Arbiters Versus Malicious Adversaries [chapter]

Serge Vaudenay
2016 Lecture Notes in Computer Science  
In this paper, we develop the notion of security based on open rules. We show the above results. We revisit the notion of related-key security of block ciphers to illustrate these results.  ...  To study feasibility, we investigate a new security notion: security against undetectable attacks.  ...  k-adaptively secure PRF.  ... 
doi:10.1007/978-3-662-49301-4_31 fatcat:kfvsjf2kqzb2nbvcg4ypscdrna

Chances, Counterfactuals, and Similarity

J. ROBERT G. WILLIAMS
2008 Philosophy and Phenomenological Research  
Typicality Let us revisit the basic intuitions. Given the information that a coin is fair, how should you expect a long enough series of coin-flips to turn out?  ...  to the particular outcome of the coin flippings.  ...  It is of little or no importance to secure approximate similarity of particular fact, even in matters that concern us greatly.  ... 
doi:10.1111/j.1933-1592.2008.00196.x fatcat:vxjhaxiwcff7xbgnmo4jarkbue

Page 4490 of Mathematical Reviews Vol. , Issue 97G [page]

1997 Mathematical Reviews  
Schnitger, Nondeterministic communication with a limited number of advice bits (551-560); Ilan Newman and Mario Szegedy, Public vs. private coin flips in one round communication games (extended abstract  ...  zero knowledge and computational equivocation (extended abstract) (629-638); Ran Canetti, Uri Feige, Oded Goldreich and Moni Naor, Adaptively secure multi-party computation (639-648); Tatsuaki Okamoto  ... 

On the Adaptive Security of the Threshold BLS Signature Scheme [article]

Renas Bacho, Julian Loss
2022 IACR Cryptology ePrint Archive  
In this work, we revisit the security of the threshold BLS signature by showing the following results, assuming 𝑡 adaptive corruptions: -We give a modular security proof that follows a two-step approach  ...  As shown by Cachin, Kursawe, and Shoup (PODC '00), schemes with unique signatures are of particular importance, as they allow to implement distributed coin flipping very efficiently and without any timing  ...  Another intriguing application of threshold signatures is distributed coin flipping.  ... 
dblp:journals/iacr/BachoL22 fatcat:yg2z3avk6bblhdwspqtimxay5i

New constructions of OSBE schemes and their applications in oblivious access control

Jinguang Han, Willy Susilo, Yi Mu, Jun Yan
2012 International Journal of Information Security  
We clarify the relationship between one-round OSBE and identity-based encryption (IBE) and show that one-round OSBE and semantically secure IBE against the adaptively chosen identity attack (IND-ID-CPA  ...  We clarify the relationship between one-round OSBE and identity-based encryption (IBE) and show that oneround OSBE and semantically secure IBE against the adaptively chosen identity attack (IND-ID-CPA)  ...  B flips an unbiased coin with {0, 1}, and obtains b ∈ {0, 1}.  ... 
doi:10.1007/s10207-012-0176-3 fatcat:d7yqryh2aje2vdofeaa2ppp4vu

Prinsys—On a Quest for Probabilistic Loop Invariants [chapter]

Friedrich Gretz, Joost-Pieter Katoen, Annabelle McIver
2013 Lecture Notes in Computer Science  
Generating a fair coin from a biased coin. In [7] , Hurd's algorithm to generate a sample according to a biased coin flip using only fair coin flips has been analysed.  ...  Using a coin with some arbitrary bias 0 < p < 1, the algorithm in Lst. 7 generates a sample according to a fair coin flip.  ... 
doi:10.1007/978-3-642-40196-1_17 fatcat:5m3ia62nmvau5ebotan3nflrnm

Revisiting the Power of Non-Equivocation in Distributed Protocols

Naama Ben-David, Benjamin Y. Chan, Elaine Shi
2022 Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing  
CCS CONCEPTS • Security and privacy → Privacy-preserving protocols; • Theory of computation → Distributed algorithms.  ...  Furthermore, we consider protocols with security and privacy guarantees that we must preserve under the compilation. Previous works have aimed to achieve a similar goal.  ...  's compiler to send the result of the random coin flip along with each message; in this case, the adversary can simply fabricate the result of its coin flips.  ... 
doi:10.1145/3519270.3538427 fatcat:i6l23mgbfnbt3o7aji5vmredsa

Communication Complexity of Byzantine Agreement, Revisited [article]

Ittai Abraham, T-H. Hubert Chan, Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi
2020 arXiv   pre-print
A few existing works have shown how to achieve subquadratic BA under an adaptive adversary.  ...  Intriguingly, they all make a common relaxation about the adaptivity of the attacker, that is, if an honest node sends a message and then gets corrupted in some round, the adversary cannot erase the message  ...  F mine then verifies the NIZK proof π, and if verification passes, it uses ρ < D p as the result of the coin flip.  ... 
arXiv:1805.03391v4 fatcat:cxhb6mf5xvb3tfft2b6bytzwbm
« Previous Showing results 1 — 15 out of 3,118 results