Sciweavers

948 search results - page 110 / 190
» What can we achieve by arbitrary announcements
Sort
View
CRYPTO
2004
Springer
162views Cryptology» more  CRYPTO 2004»
14 years 2 months ago
Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography
We propose the first distributed discrete-log key generation (DLKG) protocol from scratch which is adaptively-secure in the non-erasure model, and at the same time completely avoi...
Masayuki Abe, Serge Fehr
APSCC
2008
IEEE
14 years 3 months ago
Resource Sharing by Multilingual Expression Services
Multilingual expression services (MESs) are available in many multicultural fields, such as education, medical care, and disaster prevention. In Japan, for example, local governme...
Masaki Gotou, Hirofumi Yamaki, Daisuke Yanagisawa,...
ACISP
2004
Springer
14 years 2 months ago
Analysis and Improvement of Micali's Fair Contract Signing Protocol
In PODC 2003, Micali presented a fair electronic exchange protocol for contract signing with an invisible trusted party [17]. The protocol was filed as a US patent No 5666420 in 1...
Feng Bao, Guilin Wang, Jianying Zhou, Huafei Zhu
CSFW
2009
IEEE
14 years 3 months ago
Policy Compliance in Collaborative Systems
When collaborating agents share sensitive information to achieve a common goal it would be helpful to them to decide whether doing so will lead to an unwanted release of confiden...
Max I. Kanovich, Paul Rowe, Andre Scedrov
TLCA
2009
Springer
14 years 3 months ago
Initial Algebra Semantics for Cyclic Sharing Structures
Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanis...
Makoto Hamana