Sciweavers

35 search results - page 6 / 7
» On the Security of Goldreich's One-Way Function
Sort
View
TCC
2010
Springer
188views Cryptology» more  TCC 2010»
14 years 7 days ago
Founding Cryptography on Tamper-Proof Hardware Tokens
A number of works have investigated using tamper-proof hardware tokens as tools to achieve a variety of cryptographic tasks. In particular, Goldreich and Ostrovsky considered the ...
Vipul Goyal, Yuval Ishai, Amit Sahai, Ramarathnam ...
ECCC
1998
88views more  ECCC 1998»
13 years 5 months ago
Computational Indistinguishability: A Sample Hierarchy
We consider the existence of pairs of probability ensembles which may be efficiently distinguished from each other given k samples but cannot be efficiently distinguished given ...
Oded GoldreichMadhu Sudan
AAECC
2006
Springer
109views Algorithms» more  AAECC 2006»
13 years 5 months ago
Cryptosystems using Linear Groups
Several suggestions are presented for developing cryptosystems, both classical and public key, using a combination of combinatorial group theory and linear groups. In particular, t...
Gilbert Baumslag, Benjamin Fine, Xiaowei Xu
ASIACRYPT
2009
Springer
13 years 12 months ago
Security Notions and Generic Constructions for Client Puzzles
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...
Liqun Chen, Paul Morrissey, Nigel P. Smart, Bogdan...
GIS
2009
ACM
14 years 6 months ago
Efficient and Secure Distribution of Massive Geo-Spatial Data
Modern geographic databases can contain a large volume of data that need to be distributed to subscribed customers. The data can be modeled as a cube, where typical dimensions inc...
Hao Yuan, Mikhail J. Atallah