Sciweavers

7106 search results - page 751 / 1422
» Restricted Complexity, General Complexity
Sort
View
COMCOM
2007
111views more  COMCOM 2007»
15 years 7 months ago
An argument for simple embedded ACL optimisation
The difficulty of efficiently reordering the rules in an Access Control List is considered and the essential optimisation problem formulated. The complexity of exact and sophistic...
Vic Grout, John Davies, John McGinn
IJISEC
2006
108views more  IJISEC 2006»
15 years 7 months ago
How to obtain full privacy in auctions
Abstract Privacy has become a factor of increasing importance in auction design. We propose general techniques for cryptographic first-price and (M + 1)st-price auction protocols t...
Felix Brandt
IJNSEC
2006
98views more  IJNSEC 2006»
15 years 7 months ago
Comment on Improvement of the Miyazaki-Takaragi Threshold Digital Signature Scheme
To enhance applications of smart cards, Miyazaki and Takaragi proposed a (t, n) threshold digital signature scheme based on the security of elliptic curve discrete logarithm (ECDL...
Zuhua Shao
CORR
2007
Springer
99views Education» more  CORR 2007»
15 years 7 months ago
A parametric representation of totally mixed Nash equilibria
We present an algorithm to compute a parametric description of the totally mixed Nash equilibria of a generic game in normal form with a fixed structure. Using this representatio...
Gabriela Jeronimo, Daniel Perrucci, Juan Sabia
CORR
2007
Springer
74views Education» more  CORR 2007»
15 years 7 months ago
Secure Two-party Protocols for Point Inclusion Problem
It is well known that, in theory, the general secure multiparty computation problem is solvable using circuit evaluation protocols. However, the communication complexity of the re...
Tony Thomas