activity
20112016
most citedDistributed, End-to-end Verifiable, and Privacy-Preserving Internet Voting Systems

1 citations · 3 across the 5 of their papers we have counts for

collaborators

5 papers

cs.CR2016★ 1 cited

Distributed, End-to-end Verifiable, and Privacy-Preserving Internet Voting Systems

Nikos Chondros, Bingsheng Zhang, Thomas Zacharias +6

E-voting systems are a powerful technology for improving democracy. Unfortunately, prior voting systems have single points-of-failure, which may compromise availability, privacy, o…

cs.CR2015★ 1 cited

D-DEMOS: A distributed, end-to-end verifiable, internet voting system

Nikos Chondros, Bingsheng Zhang, Thomas Zacharias +6

E-voting systems have emerged as a powerful technology for improving democracy by reducing election cost, increasing voter participation, and even allowing voters to directly verif…

cs.DC2014

Interactive Consistency in practical, mostly-asynchronous systems

Panos Diamantopoulos, Stathis Maneas, Christos Patsonakis +2

Interactive consistency is the problem in which n nodes, where up to t may be byzantine, each with its own private value, run an algorithm that allows all non-faulty nodes to infer…

cs.DB2014

A distributed Integrity Catalog for digital repositories

Nikos Chondros, Mema Roussopoulos

Digital repositories, either digital preservation systems or archival systems, periodically check the integrity of stored objects to assure users of their correctness. To do so, pr…

cs.DC2011★ 1 cited

On the Practicality of `Practical' Byzantine Fault Tolerance

Nikos Chondros, Konstantinos Kokordelis, Mema Roussopoulos

Byzantine Fault Tolerant (BFT) systems are considered by the systems research community to be state of the art with regards to providing reliability in distributed systems. BFT sys…