Sciweavers

6861 search results - page 1283 / 1373
» Security for Ubiquitous Computing
Sort
View
CRYPTO
1998
Springer
105views Cryptology» more  CRYPTO 1998»
14 years 1 months ago
An Efficient Discrete Log Pseudo Random Generator
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...
Sarvar Patel, Ganapathy S. Sundaram
MA
1997
Springer
149views Communications» more  MA 1997»
14 years 1 months ago
Java-Based Mobile Agents - How to Migrate, Persist, and Interact on Electronic Service Markets
This paper presents a mobile agent approach that aims at satisfying the following requirements of open Internet-based electronic service markets: the mobile agent system should be...
Boris Liberman, Frank Griffel, Michael Merz, Winfr...
CRYPTO
1992
Springer
181views Cryptology» more  CRYPTO 1992»
14 years 29 days ago
Fair Public-Key Cryptosystems
Abstract Joseph Kilian NEC Research Princeton, NJ 08540 Tom Leighton Mathematics Department Laboratory for Computer Science MIT Cambridge, MA 02139 August 17, 1994 Fair" Publ...
Silvio Micali
DIM
2007
ACM
14 years 25 days ago
Linkability estimation between subjects and message contents using formal concepts
In this paper, we examine how conclusions about linkability threats can be drawn by analyzing message contents and subject knowledge in arbitrary communication systems. At first, ...
Stefan Berthold, Sebastian Clauß
CAV
2010
Springer
214views Hardware» more  CAV 2010»
14 years 24 days ago
Learning Component Interfaces with May and Must Abstractions
elor Thesis: Demand Driven Abstraction Refinement • Advisor: Dr. Andrey Rybalchenko Kendriya Vidyalaya ONGC, Dehradun, Uttaranchal INDIA All India Senior Secondary Examination, ...
Rishabh Singh, Dimitra Giannakopoulou, Corina S. P...
« Prev « First page 1283 / 1373 Last » Next »