Sciweavers

16430 search results - page 777 / 3286
» On Computable Tree Functions
Sort
View
177
Voted
IACR
2011
88views more  IACR 2011»
14 years 7 months ago
Targeted Malleability: Homomorphic Encryption for Restricted Computations
We put forward the notion of targeted malleability: given a homomorphic encryption scheme, in various scenarios we would like to restrict the homomorphic computations one can perf...
Dan Boneh, Gil Segev, Brent Waters
FCT
2003
Springer
16 years 22 days ago
Membrane Computing
: In this paper a comparison is provided between the membrane computing systems and the graphical interfaces of operating systems. A membrane computing system is a computing model ...
Gheorghe Paun
STOC
2002
ACM
152views Algorithms» more  STOC 2002»
16 years 7 months ago
Universally composable two-party and multi-party secure computation
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Ami...
HICSS
2003
IEEE
142views Biometrics» more  HICSS 2003»
16 years 24 days ago
Evolution of a Knowledge Focused Computer Supported Learning System by Ensuring Extensibility through Generalization and Replica
If sufficient attention is not paid to the information models on which Learning Platforms are based the ability to deliver rich functionality is hindered. This paper describes the...
David White, Lesley A. Gardner, Don Sheridan
WINE
2009
Springer
147views Economy» more  WINE 2009»
16 years 1 days ago
Computational Aspects of Multimarket Price Wars
We consider the complexity of decision making with regards to predatory pricing in multimarket oligopoly models. Specifically, we present multimarket extensions of the classical s...
Nithum Thain, Adrian Vetta