Sciweavers

1064 search results - page 111 / 213
» Cryptography from Anonymity
Sort
View
SP
1990
IEEE
15 years 8 months ago
Probabilistic Interference
In recent times information flow and non-interference have become very popular concepts for expressing both integrity and privacy properties. We present the first general definitio...
James W. Gray III
GLVLSI
2007
IEEE
166views VLSI» more  GLVLSI 2007»
15 years 7 months ago
Efficient pipelining for modular multiplication architectures in prime fields
This paper presents a pipelined architecture of a modular Montgomery multiplier, which is suitable to be used in public key coprocessors. Starting from a baseline implementation o...
Nele Mentens, Kazuo Sakiyama, Bart Preneel, Ingrid...
142
Voted
ASIACRYPT
2008
Springer
15 years 6 months ago
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
Andy Rupp, Gregor Leander, Endre Bangerter, Alexan...
JCIT
2007
142views more  JCIT 2007»
15 years 3 months ago
Distributed Certification Authority for Mobile Ad Hoc Networks - A Dynamic Approach
A Mobile Ad Hoc Network (MANET) is an infrastructureless network of wireless mobile nodes that cooperate among each other to maintain connectivity of the network. In comparison to...
Sanjay Raghani, Durga Toshniwal
160
Voted
MOBIHOC
2005
ACM
16 years 3 months ago
An efficient scheme for authenticating public keys in sensor networks
With the advance of technology, Public Key Cryptography (PKC) will sooner or later be widely used in wireless sensor networks. Recently, it has been shown that the performance of ...
Wenliang Du, Ronghua Wang, Peng Ning