Sciweavers

469 search results - page 68 / 94
» On Adversary Models and Compositional Security
Sort
View
EUROCRYPT
2009
Springer
14 years 8 months ago
Resettably Secure Computation
Abstract. The notion of resettable zero-knowledge (rZK) was introduced by Canetti, Goldreich, Goldwasser and Micali (FOCS'01) as a strengthening of the classical notion of zer...
Vipul Goyal, Amit Sahai
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
14 years 1 months ago
On Secure Multi-party Computation in Black-Box Groups
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxio...
IDTRUST
2009
ACM
14 years 2 months ago
Palantir: a framework for collaborative incident response and investigation
Organizations owning cyber-infrastructure assets face large scale distributed attacks on a regular basis. In the face of increasing complexity and frequency of such attacks, we ar...
Himanshu Khurana, Jim Basney, Mehedi Bakht, D. Mic...
CCS
2005
ACM
14 years 1 months ago
Keyboard acoustic emanations revisited
We examine the problem of keyboard acoustic emanations. We present a novel attack taking as input a 10-minute sound recording of a user typing English text using a keyboard, and t...
Li Zhuang, Feng Zhou, J. D. Tygar
AMW
2010
13 years 9 months ago
Certification and Authentication of Data Structures
We study query authentication schemes, algorithmic and cryptographic constructions that provide efficient and secure protocols for verifying the results of queries over structured...
Roberto Tamassia, Nikos Triandopoulos