Sciweavers

3820 search results - page 722 / 764
» Bounded Model Debugging
Sort
View
CSFW
2011
IEEE
12 years 9 months ago
Local Memory via Layout Randomization
—Randomization is used in computer security as a tool to introduce unpredictability into the software infrastructure. In this paper, we study the use of randomization to achieve ...
Radha Jagadeesan, Corin Pitcher, Julian Rathke, Ja...
IACR
2011
73views more  IACR 2011»
12 years 9 months ago
Secure Authentication from a Weak Key, Without Leaking Information
We study the problem of authentication based on a weak key in the information-theoretic setting. A key is weak if its min-entropy is an arbitrary small fraction of its bit length. ...
Niek J. Bouman, Serge Fehr
WSDM
2012
ACM
301views Data Mining» more  WSDM 2012»
12 years 5 months ago
Learning evolving and emerging topics in social media: a dynamic nmf approach with temporal regularization
As massive repositories of real-time human commentary, social media platforms have arguably evolved far beyond passive facilitation of online social interactions. Rapid analysis o...
Ankan Saha, Vikas Sindhwani
SIGCOMM
2012
ACM
12 years 15 days ago
Perspectives on network calculus: no free lunch, but still good value
ACM Sigcomm 2006 published a paper [26] which was perceived to unify the deterministic and stochastic branches of the network calculus (abbreviated throughout as DNC and SNC) [39]...
Florin Ciucu, Jens Schmitt
CRYPTO
2012
Springer
223views Cryptology» more  CRYPTO 2012»
12 years 14 days ago
Collusion-Preserving Computation
In collusion-free protocols, subliminal communication is impossible and parties are thus unable to communicate “any information beyond what the protocol allows”. Collusion-fre...
Joël Alwen, Jonathan Katz, Ueli Maurer, Vassi...