Sciweavers

679 search results - page 80 / 136
» Using decision problems in public key cryptography
Sort
View
ICCBR
2003
Springer
15 years 6 months ago
Index Driven Selective Sampling for CBR
In real environments it is often difficult to obtain a collection of cases for the case base that would cover all the problem solving situations. Although it is often somewhat eas...
Nirmalie Wiratunga, Susan Craw, Stewart Massie
PKC
2009
Springer
172views Cryptology» more  PKC 2009»
16 years 1 months ago
CCA-Secure Proxy Re-encryption without Pairings
ded abstract of this paper appears in PKC 2009, S. Jarecki, G. Tsudik (Eds.), volume 5443 of LNCS, pp. 357-376, Sringer-Verlag, 2009. CCA-Secure Proxy Re-Encryption without Pairing...
Jun Shao, Zhenfu Cao
CTRSA
2012
Springer
285views Cryptology» more  CTRSA 2012»
13 years 9 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...
TCC
2005
Springer
169views Cryptology» more  TCC 2005»
15 years 6 months ago
Chosen-Ciphertext Security of Multiple Encryption
Encryption of data using multiple, independent encryption schemes (“multiple encryption”) has been suggested in a variety of contexts, and can be used, for example, to protect ...
Yevgeniy Dodis, Jonathan Katz
CSL
2007
Springer
15 years 7 months ago
Tightening the Exchange Rates Between Automata
Automata on infinite objects were the key to the solution of several fundamental decision problems in mathematics and logic. Today, automata on infinite objects are used for form...
Orna Kupferman