Sciweavers

3228 search results - page 550 / 646
» Computationally Sound Proofs
Sort
View
TAMC
2007
Springer
15 years 11 months ago
A Note on Universal Composable Zero Knowledge in Common Reference String Model
Pass observed that universal composable zero-knowledge (UCZK) protocols in the common reference string (CRS) model, where a common reference string is selected trustily by a truste...
Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao
ICNP
2006
IEEE
15 years 11 months ago
Rigorous Protocol Design in Practice: An Optical Packet-Switch MAC in HOL
— This paper reports on an experiment in network protocol design: we use novel rigorous techniques in the design process of a new protocol, in a close collaboration between syste...
Adam Biltcliffe, Michael Dales, Sam Jansen, Tom Ri...
MMSEC
2006
ACM
102views Multimedia» more  MMSEC 2006»
15 years 11 months ago
Zero-knowledge watermark detector robust to sensitivity attacks
Current zero-knowledge watermark detectors are based on a linear correlation between the asset features and a given secret sequence. This detection function is susceptible of bein...
Juan Ramón Troncoso-Pastoriza, Fernando P&e...
PLDI
2006
ACM
15 years 11 months ago
Specifying distributed trust management in LolliMon
We propose the monadic linear logic programming language LolliMon as a new foundation for the specification of distributed trust management systems, particularly the RT framework...
Jeff Polakow, Christian Skalka
133
Voted
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 11 months ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
Gregory Valiant, Tim Roughgarden