Sciweavers

876 search results - page 64 / 176
» Limits on the Usefulness of Random Oracles
Sort
View
95
Voted
ICCSA
2007
Springer
15 years 6 months ago
Public Key Encryption with Keyword Search Based on K-Resilient IBE
An encrypted email is sent from Bob to Alice. A gateway wants to check whether a certain keyword exists in an email or not for some reason (e.g. routing). Nevertheless Alice does n...
Dalia Khader
ASIACRYPT
2004
Springer
15 years 4 months ago
Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings
Group signature schemes are cryptographic systems that provide revocable anonymity for signers. We propose a group signature scheme with constant-size public key and signature leng...
Lan Nguyen, Reihaneh Safavi-Naini
89
Voted
CORR
2007
Springer
122views Education» more  CORR 2007»
15 years 20 days ago
Practical Identity-Based Encryption (IBE) in Multiple PKG Environments and Its Applications
Abstract. Identity-based encryption (IBE) schemes are usually used in multiplePKG environments — on the one hand, each administrative domain (e.g., a relatively small and close o...
Shengbao Wang
124
Voted
ISI
2002
Springer
15 years 11 days ago
Getting right answers from incomplete multidimensional databases
Dealing with large volumes of data, OLAP data cubes aggregated values are often spoiled by errors due to missing values in detailed data. This paper suggests to adjust aggregate an...
Sabine Goutier, Georges Hébrail, Vér...
117
Voted
JOC
2002
99views more  JOC 2002»
15 years 10 days ago
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces
We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...
Phong Q. Nguyen, Igor Shparlinski