Generation of Reliable Randomness via Social Phenomena

被引:0
|
作者
De Virgilio, Roberto [1 ]
Maccioni, Antonio [1 ]
机构
[1] Univ Roma Tre, Dipartimento Ingn, Rome, Italy
来源
MODEL AND DATA ENGINEERING, MEDI 2013 | 2013年 / 8216卷
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Randomness is a hot topic in computer science due to its important implications such as cryptography, gambling, hashing algorithms and so on. Due to the implicit determinism of computer systems, randomness can only be simulated. In order to generate reliable random sequences, IT systems have to rely on hardware random number generators. Unfortunately, these devices are not always affordable and suitable in all the circumstances (e.g., personal use, data-intensive systems, mobile devices, etc.). Human-computer interaction (HCI) has recently become bidirectional: computers help human beings in carrying out their issues and human beings support computers in hard tasks. Following this trend, we introduce RANDOMDB, a database system that is able to generate reliable randomness from social phenomena. RANDOMDB extracts data from social networks to answer random queries in a flexible way. We prototyped RANDOMDB and we conducted some experiments in order to show the effectiveness and the advantages of the system.
引用
收藏
页码:65 / 77
页数:13
相关论文
共 50 条
  • [41] Common Randomness Generation over Slow Fading Channels
    Ezzine, Rami
    Wiese, Moritz
    Deppe, Christian
    Boche, Holger
    2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 1925 - 1930
  • [42] Round Complexity of Common Randomness Generation: The Amortized Setting
    Golowich, Noah
    Sudan, Madhu
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 1076 - 1095
  • [43] Common Randomness Generation and Identification over Gaussian Channels
    Ezzine, Rami
    Labidi, Wafa
    Boche, Holger
    Deppe, Christian
    2020 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2020,
  • [44] Discrete asymptotic deterministic randomness for the generation of pseudorandom bits
    Wang, Kai
    Pei, Wenjiang
    Hou, Xubo
    Hong, Song
    He, Zhenya
    PHYSICS LETTERS A, 2009, 373 (06) : 653 - 660
  • [45] Common Randomness Generation from Sources with Countable Alphabet
    Labidi, Wafa
    Ezzine, Rami
    Deppe, Christian
    Wiese, Moritz
    Boche, Holger
    ICC 2023-IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, 2023, : 2425 - 2430
  • [46] Reliable social switch
    Jake Rogers
    Nature Reviews Neuroscience, 2024, 25 : 3 - 3
  • [47] Reliable social switch
    Rogers, Jake
    NATURE REVIEWS NEUROSCIENCE, 2024, 25 (01) : 3 - 3
  • [48] Communication Complexity of Common Randomness Generation With Isotropic States
    Dong, Yangjing
    Yao, Penghui
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (08) : 5681 - 5691
  • [49] On the generation of log-Levy distributions and extreme randomness
    Eliazar, Iddo
    Klafter, Joseph
    JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2011, 44 (41)
  • [50] MODE OF DYNAMIC RANDOMNESS IN THE GENERATION OF A LASER WITH ABSORBING CELL
    VLADIMIROV, AG
    FRADKIN, EE
    OPTIKA I SPEKTROSKOPIYA, 1989, 67 (01): : 219 - 221