Sciweavers

62 search results - page 8 / 13
» Zero-Knowledge Sets with Short Proofs
Sort
View
MP
2010
81views more  MP 2010»
13 years 9 months ago
Lifting inequalities: a framework for generating strong cuts for nonlinear programs
In this paper, we propose lifting techniques for generating strong cuts for nonlinear programs that are globally-valid. The theory is geometric and provides intuition into lifting...
Jean-Philippe P. Richard, Mohit Tawarmalani
CRYPTO
2006
Springer
111views Cryptology» more  CRYPTO 2006»
14 years 2 months ago
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models
We address the message authentication problem in two seemingly different communication models. In the first model, the sender and receiver are connected by an insecure channel and...
Moni Naor, Gil Segev, Adam Smith
AAAI
2012
12 years 1 months ago
Learning Behavior Models for Hybrid Timed Systems
A tailored model of a system is the prerequisite for various analysis tasks, such as anomaly detection, fault identification, or quality assurance. This paper deals with the algo...
Oliver Niggemann, Benno Stein, Asmir Vodencarevic,...
PODC
2009
ACM
14 years 11 months ago
Brief announcement: minimum spanning trees and cone-based topology control
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
Alejandro Cornejo, Nancy A. Lynch
JOOP
1998
86views more  JOOP 1998»
13 years 10 months ago
Prelude to a Theory of Void
A set of rules to ascertain that in calls of the form x.f (...) there will always be an object attached to x. 1 PURPOSE The theory developed in this article investigates void call...
Bertrand Meyer