Sciweavers

135 search results - page 27 / 27
» Secure Mobile Computing Via Public Terminals
Sort
View
FCCM
2005
IEEE
132views VLSI» more  FCCM 2005»
13 years 11 months ago
Hardware Factorization Based on Elliptic Curve Method
The security of the most popular asymmetric cryptographic scheme RSA depends on the hardness of factoring large numbers. The best known method for factorization large integers is ...
Martin Simka, Jan Pelzl, Thorsten Kleinjung, Jens ...
MOBICOM
2004
ACM
13 years 11 months ago
Denial of service resilience in ad hoc networks
Significant progress has been made towards making ad hoc networks secure and DoS resilient. However, little attention has been focused on quantifying DoS resilience: Do ad hoc ne...
Imad Aad, Jean-Pierre Hubaux, Edward W. Knightly
SIGMOD
2008
ACM
210views Database» more  SIGMOD 2008»
14 years 5 months ago
Private queries in location based services: anonymizers are not necessary
Mobile devices equipped with positioning capabilities (e.g., GPS) can ask location-dependent queries to Location Based Services (LBS). To protect privacy, the user location must n...
Gabriel Ghinita, Panos Kalnis, Ali Khoshgozaran, C...
PERCOM
2010
ACM
13 years 9 months ago
Negotiate power and performance in the reality of RFID systems
—Recent years have witnessed the wide adoption of the RFID technology in many important application domains including logistics, inventory, retailing, public transportation, and ...
Xunteng Xu, Lin Gu, Jianping Wang, Guoliang Xing
TCC
2009
Springer
169views Cryptology» more  TCC 2009»
14 years 6 months ago
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
James Cook, Omid Etesami, Rachel Miller, Luca Trev...