Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

ASIACRYPT
2000
Springer

favoriteEmaildiscussreport

61views Cryptology» more ASIACRYPT 2000»

Provably Secure Metering Scheme

13 years 9 months ago

Provably Secure Metering Scheme

Download www.iacr.org

Abstract. Naor and Pinkas introduced metering schemes at Eurocrypt ’98 in order to decide on advertisement fees for web servers. In the schemes, any server should be able to construct a proof to be sent to an audit agency if and only if it has been visited by at least a certain number, say k, of clients. This paper ﬁrst shows an attack for their schemes such that only two malicious clients can prevent a server from computing a correct proof. We next present provably secure metering schemes. Finally, an eﬃcient robust secret sharing scheme is derived from our metering scheme.

Wakaha Ogata, Kaoru Kurosawa

Real-time Traffic

ASIACRYPT 2000 | Cryptology | Metering Scheme | Secret Sharing Scheme | Secure Metering Schemes |

claim paper

Related Content

» Robust Metering Schemes for General Access Structures

» Analysis and Design of Active IC Metering Schemes

» An Auditable Metering Scheme for Web Advertisement Applications

» On Provably Secure TimeStamping Schemes

» Efficient and Provably Secure Multireceiver IdentityBased Signcryption

» XMSS A Practical Forward Secure Signature Scheme based on Minimal Security Assumptions

» Provably Secure Partially Blind Signatures

» Provable Secure Generalized Signcryption

» An Access Control Scheme for Partially Ordered Set Hierarchy with Provable Security

Post Info
More Details (n/a)

Added	02 Aug 2010
Updated	02 Aug 2010
Type	Conference
Year	2000
Where	ASIACRYPT
Authors	Wakaha Ogata, Kaoru Kurosawa

Comments (0)