Sciweavers

49 search results - page 9 / 10
» uc 2007
Sort
View
TAMC
2007
Springer
14 years 5 months ago
A Note on Universal Composable Zero Knowledge in Common Reference String Model
Pass observed that universal composable zero-knowledge (UCZK) protocols in the common reference string (CRS) model, where a common reference string is selected trustily by a truste...
Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao
TCC
2007
Springer
116views Cryptology» more  TCC 2007»
14 years 5 months ago
Long-Term Security and Universal Composability
Abstract. Algorithmic progress and future technology threaten today’s cryptographic protocols. Long-term secure protocols should not even in future reveal more information to aâ€...
Jörn Müller-Quade, Dominique Unruh
MANSCI
2007
169views more  MANSCI 2007»
13 years 10 months ago
Performance Contracting in After-Sales Service Supply Chains
Performance-based contracting is reshaping service support supply chains in capital intensive industries such as aerospace and defense. Known as Power by the Hour in the private s...
Sang-Hyun Kim, Morris A. Cohen, Serguei Netessine
PODS
2007
ACM
142views Database» more  PODS 2007»
14 years 11 months ago
Quasi-inverses of schema mappings
Schema mappings are high-level specifications that describe the relationship between two database schemas. Two operators on schema mappings, namely the composition operator and th...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...
FOCS
2007
IEEE
14 years 5 months ago
Covert Multi-Party Computation
In STOC’05, Ahn, Hopper and Langford introduced the notion of covert computation. A covert computation protocol is one in which parties can run a protocol without knowing if oth...
Nishanth Chandran, Vipul Goyal, Rafail Ostrovsky, ...