2432 search results - page 321 / 487 » Cryptographic logical relations |
176
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
191
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
This paper considers two questions in cryptography. Cryptography Secure Against Memory Attacks. A particularly devastating side-channel attack against cryptosystems, termed the &qu...
157
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
167
click to vote
IPPS
2008
IEEE
16 years 29 days ago
2008
IEEE
Volunteer Computing is becoming a new paradigm not only for the Computational Grid, but also for institutions using production-level Data Grids because of the enormous storage pot...
146
click to vote
ASIACRYPT
2007
Springer
16 years 22 days ago
2007
Springer
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in ...