Four PANORAMIX papers were accepted at this year’s ACM Conference on Computer and Communications Security (CCS). Two papers were presented at the pre-conference workshop WPES: 16th Workshop on Privacy in the Electronic Society (WPES 2017). “Mix-ORAM: Using delegate shuffles” Raphael R. Toledo, George Danezis, Isao Echizen Abstract: Oblivious RAM (ORAM) is a key technology for
Nikos Alexopoulos (TU Damstadt) and Thomas Zacharias will present their joint work with PANORAMIX coordinator Aggelos Kiayias and Riivo Talviste (Cyberentica AS) titled “MCMix: Anonymous Messaging via Secure Multiparty Computation” at the USENIX Security conference that will be held on 16-18 August 2017, Vancouver, Canada. Abstract: We present ‘MCMix’, an anonymous messaging system that completely hides communication metadata and
Thomas Zacharias will present his joint work with PANORAMIX coordinator Aggelos Kiayias and Bingsheng Zhang (Lancaster University) titled “Ceremonies for End-to-end Verifiable Elections” at the PKC conference that will be held on March 28-31 2017, Amsterdam, The Netherlands. Abstract: State-of-the-art e-voting systems rely on voters to perform certain actions to ensure that the election authorities are
Panoramix member, Aggelos Kiayias, attended the 23rd ACM Conference on Computer and Communications Security in Vienna. Aggelos is co-author on two papers that were presented during the conference: “Practical Non-Malleable Codes from l-more Extractable Hash Functions” Aggelos Kiayias (University of Edinburgh), Feng- Hao Liu (Florida Atlantic University) and Yiannis Tselekounis (University of Athens) Abstract: In this work,
Following the last post, Panoramix members from University of Tartu also got a paper accepted to Asiacrypt 2016. The paper is called “A Shuffle Argument Secure in the Generic Model” (and authored by Prastudy Fauzi and Helger Lipmaa and Michał Zając, all from Tartu; eprint available at http://eprint.iacr.org/2016/866). A verifiable mix-net involves not only the shuffling
When owl:sameAs isn’t the Same Redux: Towards a Theory of Identity, Context, and Inference on the Semantic Web Harry Halpin, Patrick J. Hayes, and Henry S. Thompson Abstract: The Web changes knowledge representation in a number of surprising ways, and decentralized knowledge representation systems such as the Semantic Web will require a theory of identity for
SoK: Making Sense of Censorship Resistance Systems Sheharbano Khattak*, Tariq Elahi*, Laurent Simon, Colleen M. Swanson, Steven J. Murdoch, and Ian Goldberg Abstract: An increasing number of countries implement Internet censorship at different scales and for a variety of reasons. Several censorship resistance systems (CRSs) have emerged to help bypass such blocks. The diversity of the
Blockchain Mining Games Aggelos Kiayias, Elias Koutsoupias, Maria Kyropoulou, and Yiannis Tselekounis Abstract: We study the strategic considerations of miners participating in the bitcoin’s protocol. We formulate and study the stochastic game that underlies these strategic considerations. The miners collectively build a tree of blocks, and they are paid when they create a node (mine a
Foteini Baldimtsi, Aggelos Kiayias, Thomas Zacharias and Bingsheng Zhang: “Indistinguishable Proofs of Work or Knowledge“. Indistinguishable Proofs of Work or Knowledge (PoWorKs) constitute a novel class of interactive protocols where a prover can convince a verifier that she has either performed work or that she possesses knowledge of a witness to a public statement without the verifier
The PANORAMIX members Aggelos Kiayias and Thomas Zacharias in joint work with Foteini Baldimtsi and Bingsheng Zhang will present their work “Indistinguishable Proofs of Work or Knowledge” (PoWorKs) at the ASIACRYPT conference that will be held in December 4-8 2016, Hanoi, Vietnam. PoWorKs constitute a novel class of interactive protocols where a prover can convince a