• Corpus ID: 11026769

The Crypto-democracy and the Trustworthy

@article{Gambs2014TheCA,
  title={The Crypto-democracy and the Trustworthy},
  author={S{\'e}bastien Gambs and Samuel Ranellucci and Alain Tapp},
  journal={ArXiv},
  year={2014},
  volume={abs/1409.2432}
}
In the current architecture of the Internet, there is a strong asymmetry in terms of power between the entities that gather and process personal data (e.g., major Internet companies, telecom operators, cloud providers, ...) and the individuals from which this personal data is issued. In particular, individuals have no choice but to blindly trust that these entities will respect their privacy and protect their personal data. In this position paper, we address this issue by proposing an utopian… 
1 Citations

References

SHOWING 1-10 OF 41 REFERENCES

Secure Multiparty Computation and Secret Sharing

This text is the first to present a comprehensive treatment of unconditionally secure techniques for multiparty computation (MPC) and secret sharing, focusing on asymptotic results with interesting applications related to MPC.

FairplayMP: a system for secure multi-party computation

This work presents FairplayMP, a system for secure multi-party computation that supplements the Fairplay system and modified the BMR protocol in a novel way and considerably improved its performance by using the Ben-Or-Goldwasser-Wigderson (BGW) protocol for the purpose of constructing gate tables.

Founding Cryptography on Oblivious Transfer - Efficiently

We present a simple and efficient compiler for transforming secure multi-party computation (MPC) protocols that enjoy security only with an honest majority into MPC protocols that guarantee security

Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority

A new n-player MPC protocol is presented that is secure against a computationally-unbounded malicious adversary that can adaptively corrupt t < n/2 of the players, and several novel techniques are introduced that will have wider applicability.

SCAPI: The Secure Computation Application Programming Interface

This work has shown that it is possible to actually carry out secure computation for non-trivial tasks on reasonably large inputs and implemented protocols demonstrate the real eciency of known and new protocols.

Perfectly-Secure MPC with Linear Communication Complexity

This protocol provides perfect security against an active, adaptive adversary corrupting t < n/3 players, which is optimal, and improves the efficiency of perfectly secure MPC protocols by a factor of Ω(n2).

Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography

Under standard cryptographic assumptions, zero-knowledge proofs for circuit satisfiability with 2−k soundness error are obtained in which the amortized computational overhead per gate is only polylogarithmic in k, improving over the ω(k) overhead of the best previous protocols.

Multiparty Computation from Somewhat Homomorphic Encryption

We propose a general multiparty computation protocol secure against an active adversary corrupting up to $$n-1$$ of the n players. The protocol may be used to compute securely arithmetic circuits

Verifiable secret sharing and multiparty protocols with honest majority

A verifiable secret sharing protocol is presented, and it is shown that any multiparty protocol, or game with incomplete information, can be achieved if a majority of the players are honest.

Broken Promises of Privacy: Responding to the Surprising Failure of Anonymization

It is necessary to respond to the surprising failure of anonymization, and this Article provides the tools to do so.