Sciweavers

2610 search results - page 369 / 522
» Computational Probabilistic Non-interference
Sort
View
FOCS
2002
IEEE
15 years 8 months ago
On the (non)Universality of the One-Time Pad
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
Yevgeniy Dodis, Joel Spencer
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 7 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
156
Voted
DIALM
2007
ACM
144views Algorithms» more  DIALM 2007»
15 years 7 months ago
Reliable Local Broadcast in a Wireless Network Prone to Byzantine Failures
Reliable broadcast can be a very useful primitive for many distributed applications, especially in the context of sensoractuator networks. Recently, the issue of reliable broadcas...
Vartika Bhandari, Nitin H. Vaidya
144
Voted
BROADNETS
2006
IEEE
15 years 7 months ago
Wavelength Assignment in Optical Networks with Imprecise Network State Information
Efficient routing and wavelength assignment (RWA) in wavelength-routed all-optical networks is critical for achieving high efficiency over the backbone links. Extensive research ha...
Satyajeet Ahuja, Marwan Krunz, Srinivasan Ramasubr...
138
Voted
CHI
2008
ACM
15 years 5 months ago
Introducing item response theory for measuring usability inspection processes
Usability evaluation methods have a long history of research. Latest contributions significantly raised the validity of method evaluation studies. But there is still a measurement...
Martin Schmettow, Wolfgang Vietze