✦ LIBER ✦

A note on optimal metering schemes

✍ Scribed by Carlo Blundo; Stelvio Cimato; Barbara Masucci

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 105 KB
Volume: 84
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(02)00321-6

No coin nor oath required. For personal study only.

✦ Synopsis

A metering scheme is a method by which an audit agency is able to measure the interaction between servers (e.g., web servers) and clients (e.g., browsers) during a certain number of time frames. Metering schemes involve distributing information to clients and servers. Obviously, such information distribution affects the overall communication complexity. A metering scheme is said to be optimal if the information distributed to clients and servers is the minimum possible.

📜 SIMILAR VOLUMES

A note on dynamic threshold schemes

✍ Carlo Blundo 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 482 KB

On the security of metering scheme

✍ Huang Lin; Zhenfu Cao 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 223 KB

## In 2001, Harn and Lin [4] proposed a non-repudiation metering scheme. In this paper, we reveal two security weaknesses in their scheme, which could make the scheme either too inefficient or incapable of presenting the exact visiting number of a server. An improved scheme will be presented in th

A Note on Optimal Unimodular Lattices

✍ J.H Conway; N.J.A Sloane 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 169 KB

The highest possible minimal norm of a unimodular lattice is determined in dimensions n 33. There are precisely five odd 32-dimensional lattices with the highest possible minimal norm (compared with more than 8.10 20 in dimension 33). Unimodular lattices with no roots exist if and only if n 23, n{25

A note on optimal foldover design

✍ Kai-Tai Fang; Dennis K.J. Lin; Hong Qin 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 186 KB

A note on optimal fish harvest

✍ J. Sanders 📂 Article 📅 1978 🏛 Springer 🌐 English ⚖ 360 KB

A note on manipulability of large voting

A note on manipulability of large voting schemes

✍ Bezalel Peleg 📂 Article 📅 1979 🏛 Springer US 🌐 English ⚖ 434 KB

A voting system is a rule which assigns to every possible combination of votes (by any number of individuals) an alternative. We define the notion of asymptotic nonmanipulability for voting systems, and prove that every representable positiormlist voting system is asymptotically nonmanipulable. Vari