Sciweavers

4217 search results - page 17 / 844
» Computational indistinguishability logic
Sort
View
DCC
2005
IEEE
15 years 9 months ago
Signcryption with Non-interactive Non-repudiation
Signcryption [35] is a public key primitive that achieves the functionality of both an encryption scheme and a signature scheme simultaneously. It does this more efficiently than a...
John Malone-Lee
IPPS
2008
IEEE
15 years 4 months ago
Immersive real-time large-scale network simulation: A research summary
Immersive real-time large-scale network simulation is a technique that supports simulation of large-scale networks to interact with real implementations of network protocols, netw...
Jason Liu
ISCOPE
1999
Springer
15 years 2 months ago
Generic Graph Algorithms for Sparse Matrix Ordering
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical frame...
Lie-Quan Lee, Jeremy G. Siek, Andrew Lumsdaine
CCS
2006
ACM
15 years 1 months ago
Provably-secure time-bound hierarchical key assignment schemes
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...
Giuseppe Ateniese, Alfredo De Santis, Anna Lisa Fe...
JMLR
2010
106views more  JMLR 2010»
14 years 4 months ago
Improving posterior marginal approximations in latent Gaussian models
We consider the problem of correcting the posterior marginal approximations computed by expectation propagation and Laplace approximation in latent Gaussian models and propose cor...
Botond Cseke, Tom Heskes