Sciweavers

4192 search results - page 21 / 839
» Efficient testing of groups
Sort
View
ISSAC
2000
Springer
94views Mathematics» more  ISSAC 2000»
14 years 1 months ago
Computing normalizers of permutation groups efficiently using isomorphisms of association schemes
This note presents an algorithm to speed up the computation of normalizers of permutation groups. It is an application of computation of isomorphisms of association schemes. Categ...
Izumi Miyamoto
DKE
2006
110views more  DKE 2006»
13 years 10 months ago
Efficient mining of group patterns from user movement data
In this paper, we present a new approach to derive groupings of mobile users based on their movement data. We assume that the user movement data are collected by logging location ...
Yida Wang, Ee-Peng Lim, San-Yih Hwang
EUROCRYPT
2008
Springer
13 years 12 months ago
Efficient Non-interactive Proof Systems for Bilinear Groups
Non-interactive zero-knowledge proofs and non-interactive witness-indistinguishable proofs have played a significant role in the theory of cryptography. However, lack of efficienc...
Jens Groth, Amit Sahai
NETWORKING
2004
13 years 11 months ago
Efficient, Authenticated, and Fault-Tolerant Key Agreement for Dynamic Peer Groups
We present an efficient authenticated and fault-tolerant protocol (AFTD) for tree-based key agreement. Our approach is driven by the insight that when a Diffie-Hellman blinded key ...
Li Zhou, Chinya V. Ravishankar
ISW
2010
Springer
13 years 8 months ago
Efficient Computationally Private Information Retrieval from Anonymity or Trapdoor Groups
A Private Information Retrieval (PIR) protocol allows a database user, or client, to obtain information from a data- base in a manner that prevents the database from knowing which...
Jonathan T. Trostle, Andy Parrish