Sciweavers

954 search results - page 113 / 191
» On the Security of ''Golden'' Cryptography
Sort
View
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
15 years 10 months ago
Secure Arithmetic Computation with No Honest Majority
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...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
TCC
2009
Springer
142views Cryptology» more  TCC 2009»
15 years 10 months ago
Chosen-Ciphertext Security via Correlated Products
We initiate the study of one-wayness under correlated products. We are interested in identifying necessary and sufficient conditions for a function f and a distribution on inputs ...
Alon Rosen, Gil Segev
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
15 years 4 months ago
Universally Composable Security with Global Setup
Abstract. Cryptographic protocols are often designed and analyzed under some trusted set-up assumptions, namely in settings where the participants have access to global information...
Ran Canetti, Yevgeniy Dodis, Rafael Pass, Shabsi W...
WISTP
2007
Springer
15 years 4 months ago
Mobile Phones as Secure Gateways for Message-Based Ubiquitous Communication
Abstract. For ubiquitous communication self-organising adhoc networks become more and more important. We consider mobile phones as appropriate secure gateways to provide access to ...
Walter Bamberger, Oliver Welter, Stephan Spitz
ACISP
2006
Springer
15 years 3 months ago
Towards Provable Security for Ubiquitous Applications
Abstract. The emergence of computing environments where smart devices are embedded pervasively in the physical world has made possible many interesting applications and has trigger...
Mike Burmester, Tri Van Le, Breno de Medeiros