View More View Less
  • 1 Department of Computeralgebra, Eötvös Loránd University
Restricted access

Purchase article

USD  $25.00

1 year subscription (Individual Only)

USD  $800.00

In this paper we propose a decentralized privacy-preserving system which is able to share sensible data in a way, that only predefined subsets of authorized entities can recover the data after getting an additional alarm message. The protocol uses two main communication channels: a P2P network where the encrypted information is stored, and a smaller private P2P network, which consists of the authorized parties called friend-to-friend network. We describe the communication protocol fulfilling the desired security requirements. The proposed protocol achieves unconditional security. The main cryptographic building blocks of the protocol are symmetric encryption schemes and secret sharing schemes.

  • [1]

    Blakley, G. R. , Safeguarding cryptographic keys, Proceedings of the National Computer Conference, Vol. 48 (1979), pp. 313317.

  • [2]

    Isdal, T. , Piatek, M., Krishnamurthy, A. and Anderson, T., Privacy preserving P2P data sharing with One Swarm, http://www.oneswarm.org/f2f_tr.pdf.

    • Export Citation
  • [3]

    Kasza, P. , Ligeti, P. and Nagy, Á., On a Secure Distributed Data Sharing System and its Implementation, submitted to Annales Math. Inf.

    • Search Google Scholar
    • Export Citation
  • [4]

    Popescu, B. C. , Crispo, B. and Tanenbaum, A. S., Safe and Private Data Sharing with Turtle: Friends Team-Up and Beat the System, 12th International Workshop on Security Protocols (2004).

    • Search Google Scholar
    • Export Citation
  • [5]

    RetroShare: secure communications with friends available online at http://www.retroshare.sourceforge.net/.

  • [6]

    Shamir, A. , How to share a secret Communications of the ACM, Vol. 22 (1) (1979), pp. 612613.