Search Results

1 - 9 of 9 items :

  • "argumentation" x
  • IT-Security and Cryptology x
Clear All
DP5: A Private Presence Service


Users of social applications like to be notified when their friends are online. Typically, this is done by a central server keeping track of who is online and offline, as well as of all of the users’ “buddy lists”, which contain sensitive information. We present DP5, a cryptographic service that implements online presence indication in a privacy-friendly way. DP5 allows clients to register their online presence and query the presence of their list of friends while keeping this list secret. Besides presence, high-integrity status updates are supported, to facilitate key update and rendezvous protocols. While infrastructure services are required for DP5 to operate, they are designed to not require any long-term secrets and provide perfect forward secrecy in case of compromise. We provide security arguments for the indistinguishability properties of the protocol, as well as an evaluation of its scalability and performance.

Open access
Mesh: A Supply Chain Solution with Locally Private Blockchain Transactions

-and-maersk-applyblockchain-to-container-shipping . [33] J. Groth. Short pairing-based non-interactive zero-knowledge arguments. In M. Abe, editor, Advances in Cryptology - ASIACRYPT 2010 , pages 321–340. Springer, 2010. [34] J. Guo, T. Peyrin, and A. Poschmann. The photon family of lightweight hash functions. In P. Rogaway, editor, CRYPTO , pages 222–239. Springer, 2011. [35] IBM Food Trust Marketplace. , accessed: 22 Aug. 2018. [36] Aferdita Ibrahimi. Cloud computing: Pricing model. Journal of Advanced Computer Science and

Open access
Optimal Rate Private Information Retrieval from Homomorphic Encryption

, Zhuhai, China (Jun 5–8, 2007) [24] Lipmaa, H.: On Diophantine Complexity and Statistical Zero-Knowledge Arguments. In: Laih, C.S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 398–415. Springer, Heidelberg, Taipei, Taiwan (Nov 30–Dec 4, 2003) [25] Lipmaa, H.: An Oblivious Transfer Protocol with Log-Squared Communication. In: Zhou, J., Lopez, J. (eds.) ISC 2005. LNCS, vol. 3650, pp. 314–328. Springer, Heidelberg, Singapore (Sep 20–23, 2005) [26] Lipmaa, H.: First CPIR Protocol with Data-Dependent Computation. In: Lee, D., Hong, S. (eds.) ICISC 2009. LNCS

Open access
Efficient Server-Aided 2PC for Mobile Phones

arguments and their applications. In Computational Complexity, 2002. Proceedings. 17th IEEE Annual Conference on, pages 162-171. IEEE, 2002. [BHKR13] Mihir Bellare, Viet Tung Hoang, Sriram Keelveedhi, and Phillip Rogaway. Efficient garbling from a fixedkey blockcipher. In Security and Privacy (SP), 2013 IEEE Symposium on, pages 478-492. IEEE, 2013. [CADT14] Henry Carter, Chaitrali Amrutkar, Italo Dacosta, and Patrick Traynor. For your phone only: custom protocols for efficient secure function evaluation on mobile devices. Security and

Open access
An Efficient Communication System With Strong Anonymity

-knowledge argument for correctness of a shuffle. In Proceedings of the 31st Annual International Conference on Theory and Applications of Cryptographic Techniques, EUROCRYPT’12, pages 263-280, Berlin, Heidelberg, 2012. Springer-Verlag. [8] M. Bellare, R. Canetti, and H. Krawczyk. Keying hash functions for message authentication. pages 1-15. Springer- Verlag, 1996. [9] M. Bellare and C. Namprempre. Authenticated encryption: Relations among notions and analysis of the generic composition paradigm. J. Cryptol., 21(4):469-491, Sept. 2008

Open access
Topics of Controversy: An Empirical Analysis of Web Censorship Lists

arguments for IDF.” Journal of Documentation 60.5 (2004), pp. 503-520. [52] Andreas Sfakianakis, Elias Athanasopoulos, and Sotiris Ioannidis. “CensMon: A Web Censorship Monitor.” Free and Open Communications on the Internet. USENIX. 2011. [53] Dick Sites. Compact Language Detection 2. Software library. 2013-. [54] Kyle Soska and Nicolas Christin. “Automatically Detecting Vulnerable Websites Before They Turn Malicious.” USENIX Security Symposium. 2014, pp. 625-640. [55] Ramesh Subramanian. “The Growth of

Open access
The (Co-)Location Sharing Game

. Cosley, S. Suri, D. Huttenlocher, and J. Kleinberg. Inferring social ties from geographic coincidences. Proc. of PNAS , 107, 2010. [16] R. Dey, C. Tang, K. Ross, and N. Saxena. Estimating age privacy leakage in online social networks. In INFOCOM , 2012. [17] R. L. Fogues, P. K. Murukannaiah, J. M. Such, and M. P. Singh. Sharing policies in multiuser privacy scenarios: Incorporating context, preferences, and arguments in decision making. ACM Transactions on Computer-Human Interaction (TOCHI) , 24(1):5, 2017. [18] D. Fudenberg and J. Tirole. Game

Open access
Provably Secure Anonymous-yet-Accountable Crowdsensing with Scalable Sublinear Revocation

Koyama and Yukio Tsuruoka. Speeding up elliptic cryptosystems by using a signed binary window method. In CRYPTO ’92 , pages 345–357, 1992. [80] Klaus Potzmader and Johannes Winter et al. Group signatures on mobile devices: Practical experiences. In Trust and Trustworthy Computing , pages 47–64, 2013. [81] David Pointcheval and Jacques Stern. Security arguments for digital signatures and blind signatures. J. Cryptology , 13(3):361–396, 2000.

Open access
A Practical Set-Membership Proof for Privacy-Preserving NFC Mobile Ticketing

Cryptography, PKC ’99 , volume 1560 of LNCS , pages 223–234, Kamakura, Japan, Mar. 1999. Springer Berlin Heidelberg. [41] T. Pedersen. . In J. Feigenbaum, editor, Advances in Cryptology - CRYPTO ’91 , volume 576 of LNCS , pages 129–140. Springer Berlin Heidelberg, 1992. [42] D. Pointcheval and J. Stern. Security Proofs for Signature Schemes. In U. Maurer, editor, Advances in Cryptology - EUROCRYPT ’96 , volume 1070 of LNCS , pages 387–398. Springer Berlin Heidelberg, Saragossa, Spain, 1996. [43] D. Pointcheval and J. Stern. Security arguments for

Open access