Sciweavers

679 search results - page 97 / 136
» Using decision problems in public key cryptography
Sort
View
FOCS
2002
IEEE
15 years 6 months ago
On the (non)Universality of the One-Time Pad
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
Yevgeniy Dodis, Joel Spencer
MASS
2010
156views Communications» more  MASS 2010»
14 years 11 months ago
On application of Host Identity Protocol in wireless sensor networks
Recent advances in development of low-cost wireless sensor platforms open up opportunities for novel wireless sensor network (WSN) applications. Likewise emerge security concerns o...
Andrey Khurri, Dmitriy Kuptsov, Andrei Gurtov
SIGMOD
2005
ACM
105views Database» more  SIGMOD 2005»
16 years 1 months ago
Reference Reconciliation in Complex Information Spaces
Reference reconciliation is the problem of identifying when different references (i.e., sets of attribute values) in a dataset correspond to the same real-world entity. Most previ...
Xin Dong, Alon Y. Halevy, Jayant Madhavan
SOUPS
2009
ACM
15 years 7 months ago
Not one click for security?
: © Not One Click for Security Alan H. Karp, Marc Stiegler, Tyler Close HP Laboratories HPL-2009-53 Secure cooperation, usable security Conventional wisdom holds that security mus...
Alan H. Karp, Marc Stiegler, Tyler Close
JUCS
2008
144views more  JUCS 2008»
15 years 1 months ago
Applications of Mash-ups for a Digital Journal
: The WWW is currently experiencing a revolutionary growth due to numerous emerging tools, techniques and concepts. Digital journals thus need to transform themselves to cope with ...
Muhammad Salman Khan, Narayanan Kulathuramaiyer, H...