Sciweavers

679 search results - page 57 / 136
» Using decision problems in public key cryptography
Sort
View
IIWAS
2004
15 years 2 months ago
An Efficient Group Signature Based on the Discrete Logarithm Problem
Group signature schemes permit a group member signing on messages anonymously and unlinkably on behalf of a group. The anonymity can be revoked when arguments occurred. This paper...
Fuw-Yi Yang, Jinn-ke Jan
WS
2003
ACM
15 years 6 months ago
An authentication framework for hierarchical ad hoc sensor networks
Recent results indicate scalability problems for flat ad hoc networks. To address the issue of scalability, self-organizing hierarchical ad hoc architectures are being investigat...
Mathias Bohge, Wade Trappe
IPPS
1999
IEEE
15 years 5 months ago
FPGA Implementation of Modular Exponentiation
An e cient implementations of the main building block in the RSA cryptographic scheme is achieved by mapping a bit-level systolic array for modular exponentiation onto Xilinx FPGAs...
Alexander Tiountchik, Elena Trichina
AVBPA
2005
Springer
226views Biometrics» more  AVBPA 2005»
15 years 7 months ago
Discriminant Analysis Based on Kernelized Decision Boundary for Face Recognition
A novel nonlinear discriminant analysis method, Kernelized Decision Boundary Analysis (KDBA), is proposed in our paper, whose Decision Boundary feature vectors are the normal vecto...
Baochang Zhang, Xilin Chen, Wen Gao
FDTC
2007
Springer
105views Cryptology» more  FDTC 2007»
15 years 7 months ago
Tate Pairing with Strong Fault Resiliency
We present a novel non-linear error coding framework which incorporates strong adversarial fault detection capabilities into identity based encryption schemes built using Tate pai...
Erdinç Öztürk, Gunnar Gaubatz, Be...