Sciweavers

1449 search results - page 280 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
WS
2006
ACM
15 years 11 months ago
Proactive security for mobile messaging networks
The interoperability of IM (Instant Messaging) and SMS (Short Messaging Service) networks allows users to seamlessly use a variety of computing devices from desktops to cellular p...
Abhijit Bose, Kang G. Shin
SMI
2005
IEEE
15 years 10 months ago
Two-Dimensional Visibility Charts for Continuous Curves
This paper considers computation of visibility for twodimensional shapes whose boundaries are C1 continuous curves. We assume we are given a one-parameter family of candidate view...
Gershon Elber, Robert Sayegh, Gill Barequet, Ralph...
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
15 years 10 months ago
Decision Making Based on Approximate and Smoothed Pareto Curves
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
Heiner Ackermann, Alantha Newman, Heiko Rögli...
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
15 years 10 months ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith
SPW
2004
Springer
15 years 10 months ago
The Dancing Bear: A New Way of Composing Ciphers
This note presents a new way of composing cryptographic primitives which makes some novel combinations possible. For example, one can do threshold decryption using standard block c...
Ross Anderson