Sciweavers

570 search results - page 68 / 114
» Black-box constructions for secure computation
Sort
View
ASIACRYPT
2008
Springer
13 years 10 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...
CRYPTO
2009
Springer
109views Cryptology» more  CRYPTO 2009»
14 years 2 months ago
Randomizable Proofs and Delegatable Anonymous Credentials
We construct an efficient delegatable anonymous credentials system. Users can anonymously and unlinkably obtain credentials from any authority, delegate their credentials to other ...
Mira Belenkiy, Jan Camenisch, Melissa Chase, Marku...
TCC
2007
Springer
93views Cryptology» more  TCC 2007»
14 years 2 months ago
Intrusion-Resilient Key Exchange in the Bounded Retrieval Model
Abstract. We construct an intrusion-resilient symmetric-key authenticated key exchange (AKE) protocol in the bounded retrieval model. The model employs a long shared private key to...
David Cash, Yan Zong Ding, Yevgeniy Dodis, Wenke L...
WWW
2003
ACM
14 years 8 months ago
A Web Service Market Model based on Dependencies
The construction of composite Web Services from service fragments requires semantic descriptions of service offers and service requests. We propose the use of dependencies as a mo...
Robert Tolksdorf, Christian Bizer, Ralf Heese
CRYPTO
1997
Springer
169views Cryptology» more  CRYPTO 1997»
14 years 4 days ago
Deniable Encryption
Consider a situation in which the transmission of encrypted messages is intercepted by an adversary who can later ask the sender to reveal the random choices and also the secret ...
Ran Canetti, Cynthia Dwork, Moni Naor, Rafail Ostr...