Sciweavers

5484 search results - page 1010 / 1097
» Almost-Everywhere Secure Computation
Sort
View
CRYPTO
1992
Springer
181views Cryptology» more  CRYPTO 1992»
15 years 4 months ago
Fair Public-Key Cryptosystems
Abstract Joseph Kilian NEC Research Princeton, NJ 08540 Tom Leighton Mathematics Department Laboratory for Computer Science MIT Cambridge, MA 02139 August 17, 1994 Fair" Publ...
Silvio Micali
DIM
2007
ACM
15 years 3 months ago
Linkability estimation between subjects and message contents using formal concepts
In this paper, we examine how conclusions about linkability threats can be drawn by analyzing message contents and subject knowledge in arbitrary communication systems. At first, ...
Stefan Berthold, Sebastian Clauß
CAV
2010
Springer
214views Hardware» more  CAV 2010»
15 years 3 months ago
Learning Component Interfaces with May and Must Abstractions
elor Thesis: Demand Driven Abstraction Refinement • Advisor: Dr. Andrey Rybalchenko Kendriya Vidyalaya ONGC, Dehradun, Uttaranchal INDIA All India Senior Secondary Examination, ...
Rishabh Singh, Dimitra Giannakopoulou, Corina S. P...
GLVLSI
2007
IEEE
166views VLSI» more  GLVLSI 2007»
15 years 3 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...
ARCS
2004
Springer
15 years 3 months ago
A Note on Certificate Path Verification in Next Generation Mobile Communications
Abstract. Certificate-based authentication of parties provides a powerful means for verifying claimed identities, since communicating partners do not have to exchange secrets in ad...
Matthias Enzmann, Elli Giessler, Michael Haisch, B...
« Prev « First page 1010 / 1097 Last » Next »