Metering Schemes for General Access Structures

Masucci, Barbara; Stinson, Douglas R.

doi:10.1007/10722599_5

Cited by 16 publications

(27 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another positive point is that the server can verify if the information received from a client is consistent and then decide if he denies access to this client or not. These properties, satisfied also by other computational metering schemes such as the one in [23], are an improvement with respect to the unconditionally secure proposals [2,19,20].…”

Section: Comparison With Previous Metering Schemesmentioning

confidence: 74%

“…Some unconditionally secure metering schemes have been proposed [2,19,20]. On the other hand, only a few schemes in a computational setting have been proposed.…”

Section: New Computational Metering Schemesmentioning

confidence: 99%

“…These proofs can be taken into account to decide on advertisement fees for Web servers, for example. There exist proposals of metering schemes in both informationtheoretic [2,19,20] and computationally secure [20,23] scenarios. In this work, we show how any distributed signature scheme that is secure and noninteractive can be used to construct a computationally secure metering scheme.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Protocols useful on the Internet from distributed signature schemes

Daza

Herranz

Sáez

2004

IJIS

View full text Add to dashboard Cite

Distributed cryptography deals with scenarios where a cryptographic operation is performed by a collective of persons. In a distributed signature scheme, a group of players share some secret information in such a way that only authorized subsets of players can compute valid signatures. We propose methods to construct some computationally secure protocols from distributed signature schemes, namely, we construct metering schemes from distributed noninteractive signature schemes. We also show that distributed deterministic signature schemes can be used to design distributed key distribution schemes. In particular, we construct the first metering and distributed key distribution schemes based on the RSA primitive.

show abstract

Section: Comparison With Previous Metering Schemesmentioning

confidence: 74%

“…Some unconditionally secure metering schemes have been proposed [2,19,20]. On the other hand, only a few schemes in a computational setting have been proposed.…”

Section: New Computational Metering Schemesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Protocols useful on the Internet from distributed signature schemes

Daza

Herranz

Sáez

2004

IJIS

View full text Add to dashboard Cite

show abstract

“…We formally define dynamic multi-threshold metering schemes by using the entropy approach, as done in [1,3,5,6]. We use the entropy approach mainly because this leads to a compact and simple description of the schemes and because the entropy approach takes into account all probability distributions on the sets of the proofs computed by the servers.…”

Section: The Modelmentioning

confidence: 99%

“…Metering schemes with pricing [1,5] have been introduced in order to have a more flexible payment system. Finally, metering schemes for general access structures [6] have been introduced in order to measure the interaction between servers and particular groups of clients.…”

Section: Introductionmentioning

confidence: 99%

Dynamic Multi-threshold Metering Schemes

Blundo

Bonis

Masucci

et al. 2001

Selected Areas in Cryptography

Self Cite

View full text Add to dashboard Cite

Abstract.A metering scheme is a protocol in which an audit agency is able to measure the interaction between clients and servers on the web during a certain number of time frames. Naor and Pinkas [7] considered metering schemes in which any server is able to construct a proof to be sent to the audit agency if and only if it has been visited by at least a number, say h, of clients in a given time frame. In their schemes the parameter h is fixed and is the same for any server and any time frame. In this paper we introduce dynamic multi-threshold metering schemes, that are metering schemes in which there is a threshold associated to any server for any time frame. We mainly focus on the efficiency of dynamic multi-threshold metering schemes, by minimizing the information received and distributed by clients. This is important because the clients participating in the metering process do not receive any money from the audit agency.

show abstract