Sciweavers

3134 search results - page 94 / 627
» Computing full disjunctions
Sort
View
WINE
2009
Springer
93views Economy» more  WINE 2009»
15 years 9 months ago
On Stackelberg Pricing with Computationally Bounded Consumers
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
Patrick Briest, Martin Hoefer, Luciano Gualà...
EUROCRYPT
2007
Springer
15 years 8 months ago
Universally Composable Multi-party Computation Using Tamper-Proof Hardware
Protocols proven secure within the universal composability (UC) framework satisfy strong and desirable security properties. Unfortunately, it is known that within the “plain” m...
Jonathan Katz
118
Voted
EUROCRYPT
2003
Springer
15 years 7 months ago
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions
The recently proposed universally composable (UC) security framework for analyzing security of cryptographic protocols provides very strong security guarantees. In particular, a p...
Ran Canetti, Eyal Kushilevitz, Yehuda Lindell
GCC
2003
Springer
15 years 7 months ago
Component-Based Middleware Platform for Grid Computing
: In the Grid environment, user can manage and make use of web services, such as uploading or downloading web services. But when user want to download one web services to run it in...
Jianmin Zhu, Rong Chen, Guangnan Ni, Yuan Liu
98
Voted
TCOM
2008
81views more  TCOM 2008»
15 years 2 months ago
On optimal computation of MPLS label binding for multipoint-to-point connections
Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of under...
Fernando Solano, Ramón Fabregat, José...