Sciweavers

2414 search results - page 68 / 483
» Computing Normal Subgroups
Sort
View
LCN
2006
IEEE
14 years 1 months ago
Efficient Algorithms for Secure Multicast key Management
Group Multicast is becoming a prevalent issue in Network applications such as teleconferencing, payper-view, and information services. In order to secure group communications by p...
Elham Khabiri, Saïd Bettayeb
LCN
2005
IEEE
14 years 1 months ago
Secure Content Delivery using Key Composition
In this paper, we propose a novel framework for secure multicast on overlay networks. Our contributions are threefold: 1) a technique key composition is proposed to cope with the ...
Chun-Ying Huang, Yun-Peng Chiu, Kuan-Ta Chen, Hann...
ICTCS
2005
Springer
14 years 1 months ago
Quantum Algorithms for a Set of Group Theoretic Problems
This work introduces two decision problems, StabilizerD and Orbit CosetD, and gives quantum reductions from them to the problem Orbit Superposition (Friedl et al., 2003), as well a...
Stephen A. Fenner, Yong Zhang
MYCRYPT
2005
Springer
123views Cryptology» more  MYCRYPT 2005»
14 years 1 months ago
Optimization of the MOVA Undeniable Signature Scheme
This article presents optimization results on the recent MOVA undeniable signature scheme presented by Monnerat and Vaudenay at PKC ’04 as well as its generalization proposed at ...
Jean Monnerat, Yvonne Anne Oswald, Serge Vaudenay
FQAS
2004
Springer
126views Database» more  FQAS 2004»
14 years 1 months ago
Cluster Characterization through a Representativity Measure
Clustering is an unsupervised learning task which provides a decomposition of a dataset into subgroups that summarize the initial base and give information about its structure. We ...
Marie-Jeanne Lesot, Bernadette Bouchon-Meunier