Sciweavers

681 search results - page 47 / 137
» et 2006
Sort
View
ASIACRYPT
2010
Springer
14 years 7 months ago
The Round Complexity of Verifiable Secret Sharing: The Statistical Case
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan
AAAI
2007
14 years 12 months ago
Modeling and Learning Vague Event Durations for Temporal Reasoning
This paper reports on our recent work on modeling and automatically extracting vague, implicit event durations from text (Pan et al., 2006a, 2006b). It is a kind of commonsense kn...
Feng Pan, Rutu Mulkar, Jerry R. Hobbs
FC
2006
Springer
97views Cryptology» more  FC 2006»
15 years 1 months ago
Privacy-Protecting Coupon System Revisited
Abstract. At FC'05, Chen et al. introduced an elegant privacy protecting coupon (PPC) system, CESSS05 [13], in which users can purchase multi-coupons and redeem them unlinkabl...
Lan Nguyen
CORR
2006
Springer
94views Education» more  CORR 2006»
14 years 9 months ago
Cooperative Lattice Coding and Decoding
We propose novel lattice coding/decoding schemes for half-duplex outage-limited cooperative channels. These schemes are inspired by the cooperation protocols of Azarian et al. and ...
Arul D. Murugan, Kambiz Azarian, Hesham El Gamal
ACS
2007
14 years 9 months ago
Components of the Fundamental Category II
In this article we carry on the study of the fundamental category (Goubault and Raussen, 2002; Goubault, 2003) of a partially ordered topological space (Nachbin, 1965; Johnstone, 1...
Eric Goubault, Emmanuel Haucourt