Sciweavers

2430 search results - page 320 / 486
» Computing Tutte Polynomials
Sort
View
135
Voted
ATAL
2004
Springer
15 years 9 months ago
RDS: Remote Distributed Scheme for Protecting Mobile Agents
As of today no solely software-based solution that a priori protects the computation of any mobile code and/or mobile agent was presented. Furthermore, Algesheimer et al. [1], arg...
Asnat Dadon-Elichai
133
Voted
SETA
2004
Springer
122views Mathematics» more  SETA 2004»
15 years 9 months ago
New LFSR-Based Cryptosystems and the Trace Discrete Log Problem (Trace-DLP)
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially e...
Kenneth J. Giuliani, Guang Gong
112
Voted
FOCS
2003
IEEE
15 years 9 months ago
On the Implementation of Huge Random Objects
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
Oded Goldreich, Shafi Goldwasser, Asaf Nussboim
138
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
Approximating loops in a shortest homology basis from point data
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
Tamal K. Dey, Jian Sun, Yusu Wang
192
Voted
MAS
1998
Springer
172views Communications» more  MAS 1998»
15 years 7 months ago
Protecting Mobile Agents Against Malicious Hosts
A key element of any mobile code based distributed system are the security mechanisms available to protect (a) the host against potentially hostile actions of a code fragment under...
Tomas Sander, Christian F. Tschudin