Sciweavers

679 search results - page 78 / 136
» Using decision problems in public key cryptography
Sort
View
SUTC
2006
IEEE
15 years 7 months ago
An Authentication Service Based on Trust and Clustering in Wireless Ad Hoc Networks: Description and Security Evaluation
Security in wireless ad hoc networks is hard to achieve due to the vulnerability of its links, limited physical protection, and the absence of a centralized management point. Cons...
Edith C. H. Ngai, Michael R. Lyu
COCOON
2000
Springer
15 years 5 months ago
Recent Progress and Prospects for Integer Factorisation Algorithms
The integer factorisation and discrete logarithm problems are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presum...
Richard P. Brent
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
16 years 1 months ago
How Efficient Can Memory Checking Be?
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod V...
CSJM
2006
114views more  CSJM 2006»
15 years 1 months ago
Cryptoschemes Based on New Signature Formation Mechanism
Several variants of new digital signature schemes (DSS) based on the discrete logarithm and factorization problems have been proposed. Considered DSS are characterized in that a n...
Alexander A. Moldovyan, Dmitriy N. Moldovyan, L. V...
EDCC
2005
Springer
15 years 6 months ago
Gracefully Degrading Fair Exchange with Security Modules
The fair exchange problem is key to trading electronic items in systems of mutually untrusted parties. In modern variants of such systems, each party is equipped with a security mo...
Gildas Avoine, Felix C. Gärtner, Rachid Guerr...