Sciweavers

38 search results - page 2 / 8
» On the Impossibility of Strong Encryption Over
Sort
View
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
14 years 5 months ago
Simultaneous scalability and security for data-intensive web applications
For Web applications in which the database component is the bottleneck, scalability can be provided by a third-party Database Scalability Service Provider (DSSP) that caches appli...
Amit Manjhi, Anastassia Ailamaki, Bruce M. Maggs, ...
PQCRYPTO
2010
250views Cryptology» more  PQCRYPTO 2010»
13 years 8 months ago
Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
Abstract. We propose a variant of the “bonsai tree” signature scheme, a latticebased existentially unforgeable signature scheme in the standard model. Our construction offers ...
Markus Rückert
IEICET
2006
108views more  IEICET 2006»
13 years 4 months ago
Plaintext Simulatability
We propose a new security class, called plaintext-simulatability, defined over the public-key encryption schemes. The notion of plaintext simulatability (denoted PS) is similar to ...
Eiichiro Fujisaki
CANS
2010
Springer
150views Cryptology» more  CANS 2010»
13 years 2 months ago
Predicate Encryption with Partial Public Keys
Abstract. Predicate encryption is a new powerful cryptographic primitive which allows for fine-grained access control for encrypted data: the owner of the secret key can release pa...
Carlo Blundo, Vincenzo Iovino, Giuseppe Persiano
HICSS
2002
IEEE
130views Biometrics» more  HICSS 2002»
13 years 9 months ago
Experiences of Using a Public Key Infrastructure to Access Patient Confidential Data over the Internet
A project to enable health care professionals (GPs, practice nurses and diabetes nurse specialists) to access, via the Internet, confidential patient data held on a secondary care...
David W. Chadwick, Carmen Carroll, S. Harvey, John...