Sciweavers

402 search results - page 18 / 81
» Cryptosystems using Linear Groups
Sort
View
CNSR
2004
IEEE
153views Communications» more  CNSR 2004»
15 years 1 months ago
An Authenticated Broadcasting Scheme for Wireless Ad Hoc Network
In this paper, we propose a pairing-based signcryption scheme for authenticated broadcasting, which requires less computation than a previously proposed scheme suggesting identity...
Muhammad J. Bohio, Ali Miri
ISCAS
2005
IEEE
179views Hardware» more  ISCAS 2005»
15 years 3 months ago
Robust stabilization of control systems using piecewise linear Lyapunov functions and evolutionary algorithm
— Piecewise linear Lyapunov functions are used to design control gain matrices so that closed systems are robust stable and attractive regions are expanded as large as possible i...
K. Tagawa, Y. Ohta
TCC
2009
Springer
167views Cryptology» more  TCC 2009»
15 years 10 months ago
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
This paper considers two questions in cryptography. Cryptography Secure Against Memory Attacks. A particularly devastating side-channel attack against cryptosystems, termed the &qu...
Adi Akavia, Shafi Goldwasser, Vinod Vaikuntanathan
IPCO
2001
117views Optimization» more  IPCO 2001»
14 years 11 months ago
Pruning by Isomorphism in Branch-and-Cut
The paper presents a branch-and-cut for solving (0, 1) integer linear programs having a large symmetry group. The group is used for pruning the enumeration tree and for generating ...
François Margot
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
14 years 11 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III