Sciweavers

111 search results - page 19 / 23
» New Public Key Cryptosystems Based on the Dependent-RSA Prob...
Sort
View
IJNSEC
2008
154views more  IJNSEC 2008»
13 years 11 months ago
ID-based Weak Blind Signature From Bilinear Pairings
In a blind signature scheme, the user can get a signature sig(m) on message m generated from the signer's blind signature sig(m ) on blinded message m , but the signer can�...
Ze-mao Zhao
CTRSA
2010
Springer
191views Cryptology» more  CTRSA 2010»
14 years 2 months ago
Making the Diffie-Hellman Protocol Identity-Based
This paper presents a new identity based key agreement protocol. In id-based cryptography (introduced by Adi Shamir in [33]) each party uses its own identity as public key and rece...
Dario Fiore, Rosario Gennaro
CJ
2006
100views more  CJ 2006»
13 years 11 months ago
Deterministic Identity-Based Signatures for Partial Aggregation
Aggregate signatures are a useful primitive which allows to aggregate into a single and constant-length signature many signatures on different messages computed by different users...
Javier Herranz
PKC
2007
Springer
124views Cryptology» more  PKC 2007»
14 years 5 months ago
Practical and Secure Solutions for Integer Comparison
Abstract. Yao’s classical millionaires’ problem is about securely determining whether x > y, given two input values x, y, which are held as private inputs by two parties, re...
Juan A. Garay, Berry Schoenmakers, José Vil...
CTRSA
2012
Springer
285views Cryptology» more  CTRSA 2012»
12 years 6 months ago
Plaintext-Checkable Encryption
We study the problem of searching on encrypted data, where the search is performed using a plaintext message or a keyword, rather than a message-specific trapdoor as done by state...
Sébastien Canard, Georg Fuchsbauer, Aline G...