Results 1 - 10 of 1,243

A hard-core predicate for all one-way functions

by Oded Goldreich, Leonid A. Levint - In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing , 1989
"... Abstract rity of f. In fact, for inputs (to f*) of practical size, the pieces effected by f are so small A central tool in constructing pseudorandom that f can be inverted (and the “hard-core” generators, secure encryption functions, and bit computed) by exhaustive search. in other areas are “hard-c ..."
Abstract - Cited by 440 (5 self) - Add to MetaCart
Abstract rity of f. In fact, for inputs (to f*) of practical size, the pieces effected by f are so small A central tool in constructing pseudorandom that f can be inverted (and the “hard-core” generators, secure encryption functions, and bit computed) by exhaustive search. in other areas are “hard

Protecting respondents’ identities in microdata release

by Pierangela Samarati - In IEEE Transactions on Knowledge and Data Engineering (TKDE , 2001
"... Today’s globally networked society places great demand on the dissemination and sharing of information. While in the past released information was mostly in tabular and statistical form, many situations call today for the release of specific data (microdata). In order to protect the anonymity of the ..."
Abstract - Cited by 512 (32 self) - Add to MetaCart
of the entities (called respondents) to which information refers, data holders often remove or encrypt explicit identifiers such as names, addresses, and phone numbers. De-identifying data, however, provides no guarantee of anonymity. Released information often contains other data, such as race, birth date, sex

The inductive approach to verifying cryptographic protocols

by Lawrence C. Paulson - Journal of Computer Security , 1998
"... Informal arguments that cryptographic protocols are secure can be made rigorous using inductive definitions. The approach is based on ordinary predicate calculus and copes with infinite-state systems. Proofs are generated using Isabelle/HOL. The human effort required to analyze a protocol can be as ..."
Abstract - Cited by 480 (29 self) - Add to MetaCart
Informal arguments that cryptographic protocols are secure can be made rigorous using inductive definitions. The approach is based on ordinary predicate calculus and copes with infinite-state systems. Proofs are generated using Isabelle/HOL. The human effort required to analyze a protocol can

Predicate encryption for circuits from LWE

by Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee , 2015
"... In predicate encryption, a ciphertext is associated with descriptive attribute values x in addition to a plaintext µ, and a secret key is associated with a predicate f. Decryption returns plaintext µ if and only if f(x) = 1. Moreover, security of predicate encryption guarantees that an adversary le ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
In predicate encryption, a ciphertext is associated with descriptive attribute values x in addition to a plaintext µ, and a secret key is associated with a predicate f. Decryption returns plaintext µ if and only if f(x) = 1. Moreover, security of predicate encryption guarantees that an adversary

Forward-Secure Hierarchical Predicate Encryption ⋆

by Juan Manuel, González Nieto, Mark Manulis, Dongdong Sun
"... Abstract. Secrecy of decryption keys is an important pre-requisite for security of any encryption scheme and compromised private keys must be immediately replaced. Forward Security (FS), introduced to Public Key Encryption (PKE) by Canetti, Halevi, and Katz (Eurocrypt 2003), reduces damage from comp ..."
Abstract - Add to MetaCart
compromised keys by guaranteeing confidentiality of messages that were encrypted prior to the compromise event. The FS property was also shown to be achievable in (Hierarchical) Identity-Based Encryption (HIBE) by Yao, Fazio, Dodis, and Lysyanskaya (ACM CCS 2004). Yet, for emerging encryption techniques

Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products

by Jonathan Katz, Amit Sahai, Brent Waters
"... Abstract. Predicate encryption is a new paradigm generalizing, among other things, identity-based encryption. In a predicate encryption scheme, secret keys correspond to predicates and ciphertexts are associated with attributes; the secret key SKf corresponding to a predicate f can be used to decryp ..."
Abstract - Cited by 173 (23 self) - Add to MetaCart
Abstract. Predicate encryption is a new paradigm generalizing, among other things, identity-based encryption. In a predicate encryption scheme, secret keys correspond to predicates and ciphertexts are associated with attributes; the secret key SKf corresponding to a predicate f can be used

A Secure and Optimally Efficient Multi-Authority Election Scheme

by Ronald Cramer, Rosario Gennaro, Berry Schoenmakers , 1997
"... Abstract. In this paper we present a new multi-authority secret-ballot election scheme that guarantees privacy, universal verifiability, and robustness. It is the first scheme for which the performance is optimal in the sense that time and communication complexity is minimal both for the individual ..."
Abstract - Cited by 308 (6 self) - Add to MetaCart
Abstract. In this paper we present a new multi-authority secret-ballot election scheme that guarantees privacy, universal verifiability, and robustness. It is the first scheme for which the performance is optimal in the sense that time and communication complexity is minimal both for the individual

Predicate Privacy in Encryption Systems

by Emily Shen, Elaine Shi, Brent Waters , 2008
"... Predicate encryption is a new encryption paradigm which gives a master secret key owner fine-grained control over access to encrypted data. The master secret key owner can generate secret key tokens corresponding to predicates. An encryption of data x can be evaluated using a secret token correspond ..."
Abstract - Cited by 66 (8 self) - Add to MetaCart
Predicate encryption is a new encryption paradigm which gives a master secret key owner fine-grained control over access to encrypted data. The master secret key owner can generate secret key tokens corresponding to predicates. An encryption of data x can be evaluated using a secret token

Structural Joins: A Primitive for Efficient XML Query Pattern Matching

by Shurug Al-Khalifa, H. V. Jagadish, Nick Koudas, Jignesh M. Patel, Divesh Srivastava, Yuqing Wu - In ICDE , 2002
"... XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relationships are parent-child and ancestor-descendant, and finding all occurrences of these structural relationships in an XML da ..."
Abstract - Cited by 279 (27 self) - Add to MetaCart
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relationships are parent-child and ancestor-descendant, and finding all occurrences of these structural relationships in an XML

Searchable symmetric encryption: improved definitions and efficient constructions

by Reza Curtmola, Juan Garay, Seny Kamara, Rafail Ostrovsky - Proceedings of the 13th ACM conference on Computer and communications security, CCS ’06, ACM , 2006
"... Searchable symmetric encryption (SSE) allows a party to outsource the storage of his data to another party in a private manner, while maintaining the ability to selectively search over it. This problem has been the focus of active research and several security definitions and constructions have been ..."
Abstract - Cited by 187 (7 self) - Add to MetaCart
Searchable symmetric encryption (SSE) allows a party to outsource the storage of his data to another party in a private manner, while maintaining the ability to selectively search over it. This problem has been the focus of active research and several security definitions and constructions have
Results 1 - 10 of 1,243