Proceedings ArticleDOI
Information-flow types for homomorphic encryptions
Cédric Fournet,Jérémy Planul,Tamara Rezk +2 more
- pp 351-360
Reads0
Chats0
TLDR
A flexible information-flow type system for a range of encryption primitives, precisely reflecting their diverse functional and security features, which enables encryption, blinding, homomorphic computation, and decryption, with selective key re-use for different types of payloads.Abstract:
We develop a flexible information-flow type system for a range of encryption primitives, precisely reflecting their diverse functional and security features. Our rules enable encryption, blinding, homomorphic computation, and decryption, with selective key re-use for different types of payloads. We show that, under standard cryptographic assumptions, any well-typed probabilistic program using encryptions is secure that is, computationally non-interferent) against active adversaries, both for confidentiality and integrity. We illustrate our approach using %on classic schemes such as ElGamal and Paillier encryption. We present two applications of cryptographic verification by typing: (1) private search on data streams; and (2) the bootstrapping part of Gentry's fully homomorphic encryption. We provide a prototype typechecker for our system.read more
Citations
More filters
Proceedings ArticleDOI
MrCrypt: static analysis for secure cloud computations
TL;DR: This work describes MrCrypt, a system that provides data confidentiality in this setting by executing client computations on encrypted data by statically analyzes a program to identify the set of operations on each input data column, in order to select an appropriate homomorphic encryption scheme for that column.
Posted Content
Raziel: Private and Verifiable Smart Contracts on Blockchains
TL;DR: An implementation of ZRaziel, which combines secure multi-party computation and proof-carrying code to provide privacy, correctness and verifiability guarantees for smart contracts on blockchains, is described and examples to demonstrate its practical viability are presented.
Posted Content
A Framework for the Cryptographic Verification of Java-like Programs.
TL;DR: In this article, the authors consider the problem of establishing computational indistinguishability for Java or Java-like programs that use cryptography and propose a general framework that enables existing program analysis tools that can check (standard) non-interference properties of Java programs to establish cryptographic security guarantees, even if the tools a priori cannot deal with cryptography.
Proceedings ArticleDOI
A Framework for the Cryptographic Verification of Java-Like Programs
TL;DR: A general framework that enables existing program analysis tools that can check (standard) non-interference properties of Java programs to establish cryptographic security guarantees, even if the tools a priori cannot deal with cryptography is proposed.
Proceedings ArticleDOI
AUTOCRYPT: enabling homomorphic computation on servers to protect sensitive web content
TL;DR: This work develops a tool called AutoCrypt, which transforms a subset of existing C functionality in the web stack to operate on encrypted sensitive content, and shows that such a transformation is feasible for several standard Unix utilities available in a typical LAMP stack, with no developer effort.
References
More filters
Journal ArticleDOI
A public key cryptosystem and a signature scheme based on discrete logarithms
TL;DR: A new signature scheme is proposed, together with an implementation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem that relies on the difficulty of computing discrete logarithms over finite fields.
Book ChapterDOI
Public-key cryptosystems based on composite degree residuosity classes
TL;DR: A new trapdoor mechanism is proposed and three encryption schemes are derived : a trapdoor permutation and two homomorphic probabilistic encryption schemes computationally comparable to RSA, which are provably secure under appropriate assumptions in the standard model.
Proceedings ArticleDOI
Fully homomorphic encryption using ideal lattices
TL;DR: This work proposes a fully homomorphic encryption scheme that allows one to evaluate circuits over encrypted data without being able to decrypt, and describes a public key encryption scheme using ideal lattices that is almost bootstrappable.
Proceedings ArticleDOI
Security Policies and Security Models
Joseph A. Goguen,José Meseguer +1 more
TL;DR: The reader is familiar with the ubiquity of information in the modern world and is sympathetic with the need for restricting rights to read, add, modify, or delete information in specific contexts.
Book ChapterDOI
Evaluating 2-DNF formulas on ciphertexts
TL;DR: A homomorphic public key encryption scheme that allows the public evaluation of ψ given an encryption of the variables x1,...,xn and can evaluate quadratic multi-variate polynomials on ciphertexts provided the resulting value falls within a small set.