Sciweavers

332 search results - page 31 / 67
» Token-Controlled Public Key Encryption
Sort
View
ASIACRYPT
2010
Springer
14 years 9 months ago
A Closer Look at Anonymity and Robustness in Encryption Schemes
Abstract. In this work, we take a closer look at anonymity and robustness in encryption schemes. Roughly speaking, an anonymous encryption scheme hides the identity of the secret-k...
Payman Mohassel
CRYPTO
2012
Springer
327views Cryptology» more  CRYPTO 2012»
13 years 2 months ago
Functional Encryption for Regular Languages
We provide a functional encryption system that supports functionality for regular languages. In our system a secret key is associated with a Deterministic Finite Automata (DFA) M....
Brent Waters
IACR
2011
196views more  IACR 2011»
13 years 11 months ago
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
Gilad Asharov, Abhishek Jain, Daniel Wichs
TCS
2008
14 years 11 months ago
Cryptographically-masked flows
Abstract. Cryptographic operations are essential for many security-critical systems. Reasoning about information flow in such systems is challenging because typical (noninterferenc...
Aslan Askarov, Daniel Hedin, Andrei Sabelfeld
TCC
2005
Springer
132views Cryptology» more  TCC 2005»
15 years 5 months ago
Evaluating 2-DNF Formulas on Ciphertexts
Let ψ be a 2-DNF formula on boolean variables x1, . . . , xn ∈ {0, 1}. We present a homomorphic public key encryption scheme that allows the public evaluation of ψ given an en...
Dan Boneh, Eu-Jin Goh, Kobbi Nissim