References of "Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica"
     in
Bookmark and Share    
Peer Reviewed
See detailDining Cryptographers with 0.924 Verifiable Collision Resolution
Franck, Christian UL

in Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica (2014), 14(1), 49-59

The dining cryptographers protocol implements a multiple access channel in which senders and recipients are anonymous. A problem is that a malicious participant can disrupt communication by deliberately ... [more ▼]

The dining cryptographers protocol implements a multiple access channel in which senders and recipients are anonymous. A problem is that a malicious participant can disrupt communication by deliberately creating collisions. We propose a computationally secure dining cryptographers protocol with collision resolution that achieves a maximum stable throughput of 0.924 messages per round and which allows to easily detect disruptors. [less ▲]

Detailed reference viewed: 90 (6 UL)
Full Text
Peer Reviewed
See detailHardened Bloom Filters, with an Application to Unobservability
Bernard, Nicolas UL; Leprévost, Franck UL

in Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica (2013), 12(4), 11-22

Classical Bloom filters may be used to elegantly check if an element e belongs to a set S, and, if not, to add e to S. They do not store any data and only provide boolean answers regarding the membership ... [more ▼]

Classical Bloom filters may be used to elegantly check if an element e belongs to a set S, and, if not, to add e to S. They do not store any data and only provide boolean answers regarding the membership of a given element in the set, with some probability of false positive answers. Bloom filters are often used in caching system to check that some requested data actually exist before doing a costly lookup to retrieve them. However, security issues may arise for some other applications where an active attacker is able to inject data crafted to degrade the filters’ algorithmic properties, resulting for instance in a Denial of Service (DoS) situation. This leads us to the concept of hardened Bloom filters, combining classical Bloom filters with cryptographic hash functions and secret nonces. We show how this approach is successfully used in the TrueNyms unobservability system and protects it against replay attacks. [less ▲]

Detailed reference viewed: 148 (20 UL)