Sciweavers

172 search results - page 28 / 35
» Black-Box Constructions of Protocols for Secure Computation
Sort
View
ASIACRYPT
2000
Springer
15 years 10 months ago
Zero-Knowledge and Code Obfuscation
In this paper, we investigate the gap between auxiliary-input zero-knowledge (AIZK) and blackbox-simulation zero-knowledge (BSZK). It is an interesting open problem whether or not ...
Satoshi Hada
ACNS
2009
Springer
142views Cryptology» more  ACNS 2009»
16 years 19 days ago
Group Key Exchange Enabling On-Demand Derivation of Peer-to-Peer Keys
We enrich the classical notion of group key exchange (GKE) protocols by a new property that allows each pair of users to derive an independent peer-to-peer (p2p) key on-demand and ...
Mark Manulis
SRDS
2008
IEEE
16 years 12 days ago
POSH: Proactive co-Operative Self-Healing in Unattended Wireless Sensor Networks
Unattended Wireless Sensor Networks (UWSNs) are composed of many small resource-constrained devices and operate autonomously, gathering data which is periodically collected by a v...
Roberto Di Pietro, Di Ma, Claudio Soriente, Gene T...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
16 years 6 months ago
Non-malleable extractors and symmetric key cryptography from weak secrets
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
Yevgeniy Dodis, Daniel Wichs
ASIACRYPT
2008
Springer
15 years 8 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...