Sciweavers

1274 search results - page 102 / 255
» New Proofs for
Sort
View
CCS
2007
ACM
14 years 4 months ago
Attribute-based encryption with non-monotonic access structures
We construct an Attribute-Based Encryption (ABE) scheme that allows a user’s private key to be expressed in terms of any access formula over attributes. Previous ABE schemes wer...
Rafail Ostrovsky, Amit Sahai, Brent Waters
GECCO
2004
Springer
132views Optimization» more  GECCO 2004»
14 years 3 months ago
Grammatical Swarm
Abstract. This proof of concept study examines the possibility of specifying the construction of programs using a Particle Swarm algorithm, and represents a new form of automatic p...
Michael O'Neill, Anthony Brabazon
FSE
2003
Springer
112views Cryptology» more  FSE 2003»
14 years 3 months ago
Practical Symmetric On-Line Encryption
Abstract. This paper addresses the security of symmetric cryptosystems in the blockwise adversarial model. At Crypto 2002, Joux, Martinet and Valette have proposed a new kind of at...
Pierre-Alain Fouque, Gwenaëlle Martinet, Guil...
STACS
2009
Springer
14 years 2 months ago
Lower Bounds for Multi-Pass Processing of Multiple Data Streams
ABSTRACT. This paper gives a brief overview of computation models for data stream processing, and it introduces a new model for multi-pass processing of multiple streams, the so-ca...
Nicole Schweikardt
CRYPTO
2001
Springer
139views Cryptology» more  CRYPTO 2001»
14 years 2 months ago
Soundness in the Public-Key Model
The public-key model for interactive proofs has proved to be quite effective in improving protocol efficiency [CGGM00]. We argue, however, that its soundness notion is more subtle...
Silvio Micali, Leonid Reyzin