Sciweavers

2601 search results - page 461 / 521
» Secure Rewarding Schemes
Sort
View
ACNS
2010
Springer
154views Cryptology» more  ACNS 2010»
15 years 4 months ago
Shrinking the Keys of Discrete-Log-Type Lossy Trapdoor Functions
To this day, realizations in the standard-model of (lossy) trapdoor functions from discrete-log-type assumptions require large public key sizes, e.g., about Θ(λ2 ) group elements...
Xavier Boyen, Brent Waters
ICCD
2007
IEEE
152views Hardware» more  ICCD 2007»
15 years 3 months ago
Compiler-assisted architectural support for program code integrity monitoring in application-specific instruction set processors
As application-specific instruction set processors (ASIPs) are being increasingly used in mobile embedded systems, the ubiquitous networking connections have exposed these systems...
Hai Lin, Xuan Guan, Yunsi Fei, Zhijie Jerry Shi
EUROCRYPT
2006
Springer
15 years 3 months ago
Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
The Isomorphism of Polynomials (IP) [28], which is the main concern of this paper, originally corresponds to the problem of recovering the secret key of a C scheme [26]. Besides, t...
Jean-Charles Faugère, Ludovic Perret
FDTC
2006
Springer
102views Cryptology» more  FDTC 2006»
15 years 3 months ago
Non-linear Residue Codes for Robust Public-Key Arithmetic
We present a scheme for robust multi-precision arithmetic over the positive integers, protected by a novel family of non-linear arithmetic residue codes. These codes have a very hi...
Gunnar Gaubatz, Berk Sunar, Mark G. Karpovsky
CCGRID
2001
IEEE
15 years 3 months ago
Latency Hiding in Dynamic Partitioning and Load Balancing of Grid Computing Applications
The Information Power Grid (IPG) concept developed by NASA is aimed to provide a metacomputing platform for large-scale distributed computations, by hiding the intricacies of a hig...
Sajal K. Das, Daniel J. Harvey, Rupak Biswas