Beating the Birthday Paradox in Dining Cryptographer Networks

2015 ◽  
pp. 179-198
Author(s):  
Pablo García ◽  
Jeroen van de Graaf ◽  
Alejandro Hevia ◽  
Alfredo Viola
Keyword(s):  
Birthday Paradox

Birthday Paradox for Multi-Collisions

2008 ◽  
Vol E91-A (1) ◽  
pp. 39-45 ◽  
Author(s):  
K. SUZUKI ◽  
D. TONIEN ◽  
K. KUROSAWA ◽  
K. TOYOTA
Keyword(s):  
Birthday Paradox

scholarly journals Birthday paradox, coupon collectors, caching algorithms and self-organizing search

1992 ◽  
Vol 39 (3) ◽  
pp. 207-229 ◽  
Author(s):  
Philippe Flajolet ◽  
Danièle Gardy ◽  
Loÿs Thimonier
Keyword(s):  
Birthday Paradox ◽  
Self Organizing

scholarly journals Multi Party Computation Motivated by the Birthday Problem

2019 ◽  
Vol 24 (1) ◽  
pp. 29-41
Author(s):  
Péter Hudoba ◽  
Péter Burcsi
Keyword(s):  
Communication Complexity ◽  
Privacy Preserving ◽  
Birthday Problem ◽  
Birthday Paradox

Suppose there are n people in a classroom and we want to decide if there are two of them who were born on the same day of the year. The well-known birthday paradox is concerned with the probability of this event and is discussed in many textbooks on probability. In this paper we focus on cryptographic aspects of the problem: how can we decide if there is a collision of birthdays without the participants disclosing their respective date of birth. We propose several procedures for solving this in a privacy-preserving way and compare them according to their computational and communication complexity.

scholarly journals k-Root-n: An Efficient Algorithm for Avoiding Short Term Double-Spending Alongside Distributed Ledger Technologies such as Blockchain

Information ◽  
2020 ◽  
Vol 11 (2) ◽  
pp. 90 ◽  
Author(s):  
Zvi Schreiber
Keyword(s):  
High Probability ◽  
Due Diligence ◽  
Short Term ◽  
Byzantine Faults ◽  
Global Consensus ◽  
Distributed Ledger ◽  
Velocity Of Money ◽  
Very High ◽  
Birthday Paradox

Blockchains such as the bitcoin blockchain depend on reaching a global consensus on the distributed ledger; therefore, they suffer from well-known scalability problems. This paper proposes an algorithm that avoids double-spending in the short term with just O(√n) messages instead of O(n); each node receiving money off-chain performs the due diligence of consulting k√n random nodes to check if any of them is aware of double-spending. Two nodes receiving double-spent money will in this way consult at least one common node with very high probability, because of the ‘birthday paradox’, and any common honest node consulted will detect the fraud. Since the velocity of money in the real world has coins circulating through at most a few wallets per day, the size of the due diligence communication is small in the short term. This ‘k-root-n’ algorithm is suitable for an environment with synchronous or asynchronous (but with fairly low latency) communication and with Byzantine faults. The presented k-root-n algorithm should be practical to avoid double-spending with arbitrarily high probability, while feasibly coping with the throughput of all world commerce. It is resistant to Sybil attacks even beyond 50% of nodes. In the long term, the k-root-n algorithm is less efficient. Therefore, it should preferably be used as a complement, and not a replacement, to a global distributed ledger technology.

Sign in / Sign up

Export Citation Format

Share Document