Sciweavers

498 search results - page 59 / 100
» New Constructions for IPP Codes
Sort
View
EUROCRYPT
2008
Springer
15 years 3 months ago
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
Consider an abstract storage device (G) that can hold a single element x from a fixed, publicly known finite group G. Storage is private in the sense that an adversary does not hav...
Ronald Cramer, Yevgeniy Dodis, Serge Fehr, Carles ...
LCTRTS
2004
Springer
15 years 7 months ago
A trace-based binary compilation framework for energy-aware computing
Energy-aware compilers are becoming increasingly important for embedded systems due to the need to meet conflicting constraints on time, code size and power consumption. We intro...
Lian Li 0002, Jingling Xue
ASIACRYPT
2008
Springer
15 years 4 months ago
Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether o...
Zhifang Zhang, Mulan Liu, Yeow Meng Chee, San Ling...
ECCC
1998
105views more  ECCC 1998»
15 years 1 months ago
Pseudorandom generators without the XOR Lemma
Impagliazzo and Wigderson IW97] have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (for all but nitely many n) ...
Madhu Sudan, Luca Trevisan, Salil P. Vadhan
ICLP
1997
Springer
15 years 5 months ago
A Practical Approach to Structure Reuse of Arrays in Single Assignment Languages
Array updates in single assignment languages generally require some copying of the array, and thus tend to be more expensive than in imperative languages. As a result, programs in...
Andreas Kågedal, Saumya K. Debray