Sciweavers

604 search results - page 29 / 121
» Efficient Computation of Multiplicative Inverses for Cryptog...
Sort
View
WECWIS
2005
IEEE
116views ECommerce» more  WECWIS 2005»
14 years 1 months ago
Security and Privacy Using One-Round Zero-Knowledge Proofs
A zero-knowledge proof (ZKP) is an interactive proof that allows a prover to prove the knowledge of a secret to a verifier without revealing it. ZKPs are powerful tools to deal wi...
Sultan Almuhammadi, Clifford Neuman
IJCAI
2003
13 years 9 months ago
Switching Hypothesized Measurements: A Dynamic Model with Applications to Occlusion Adaptive Joint Tracking
This paper proposes a dynamic model supporting multimodal state space probability distributions and presents the application of the model in dealing with visual occlusions when tr...
Yang Wang 0002, Tele Tan, Kia-Fock Loe
ARITH
2005
IEEE
14 years 1 months ago
Fast Modular Reduction for Large Wordlengths via One Linear and One Cyclic Convolution
Abstract— Modular reduction is a fundamental operation in cryptographic systems. Most well known modular reduction methods including Barrett’s and Montgomery’s algorithms lev...
Dhananjay S. Phatak, Tom Goff
ACL
1998
13 years 9 months ago
Memoisation for Glue Language Deduction and Categorial Parsing
The multiplicative fragment of linear logic has found a number of applications in computational linguistics: in the "glue language" approach to LFG semantics, and in the...
Mark Hepple
TDP
2010
166views more  TDP 2010»
13 years 2 months ago
Communication-Efficient Privacy-Preserving Clustering
The ability to store vast quantities of data and the emergence of high speed networking have led to intense interest in distributed data mining. However, privacy concerns, as well ...
Geetha Jagannathan, Krishnan Pillaipakkamnatt, Reb...