Micali S., Rivest R.: Micropayments Revisited. CT-RSA (2002) 149--163 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Charging and Rewarding Scheme for Packet.. - Salem.. (2003) (10 citations) (Correct)
....for long routes but will make a profit from short routes. The charge n(L # ) and the rewards #(L # ) should thus be set so that relative to the average path length the operator makes the desired profit on average. More details about the averaging principle for micropayments are presented in [26]. 6. SECURITY As we will see in Subsection 6.1, we provide incentives to foster collaboration between rational participants. Furthermore, we design our protocol in a way that it also provides disincentives against cheating (see Subsection 6.2) 6.1 Incentives for collaboration The up stream ....
S. Micali and R. L. Rivest. Micropayments Revisited. In Proceedings of the Cryptographer's Track at the RSA Conference 2002.
A Micro-Payment Scheme Encouraging Collaboration in.. - Jakobsson, Hubaux.. (2003) (12 citations) (Correct)
....device has a threshold determining when they will collaborate. Moreover, there are easier ways of mounting denial of service attacks, such as simply jamming the communication channel. A third component is a technique for aggregation of payments. Similar to the recent proposal by Micali and Rivest [16], this works by a probabilistic selection of payment tokens. As in [16] we allow this aggregation to be performed by the mobile devices (payees) for whom storage is a scarce resource. We also consider aggregation of payment information by the base stations as an additional costsaving measure. To ....
....there are easier ways of mounting denial of service attacks, such as simply jamming the communication channel. A third component is a technique for aggregation of payments. Similar to the recent proposal by Micali and Rivest [16] this works by a probabilistic selection of payment tokens. As in [16], we allow this aggregation to be performed by the mobile devices (payees) for whom storage is a scarce resource. We also consider aggregation of payment information by the base stations as an additional costsaving measure. To increase the granularity of payments, a user with a winning ticket ....
[Article contains additional citation context not shown here]
S. Micali, R. Rivest, "Micropayments Revisited," CT-RSA 2002, pp. 149-163
Unique Signatures and Veriable Random Functions - Lysyanskaya (2002) (8 citations) (Correct)
....to an exponential number of random looking bits, which can be of use in protocols. For example, using veri able random functions, one can reduce the number of rounds for resettable zero knowledge proofs to 3 in the bare model [MR01] Another example application, due to Micali and Rivest [MR02], is a non interactive lottery system used in micropayments. Here, the lottery organizer holds a public key PK of a VRF. A participant creates his lottery ticket t himself and sends it to the organizer. The organizer computes the value y = FPK (t) on the lottery ticket, and the corresponding proof ....
Silvio Micali and Ronald L. Rivest. Micropayments revisited. In Bart Preneel, editor, Proceedings of the Cryptographer's Track at the RSA Conference, volume 2271 of Lecture Notes in Computer Science, pages 149-163. Springer Verlag, 2002.
Efficient Construction of (Distributed) Verifiable Random Functions - Dodis (2002) (Correct)
....(and proved) VRFs already found several applications. For example, using VRFs one can reduce the number of rounds for resettable zero knowledge proofs to 3 in the bare model [MR01] As another interesting application, they can be used in a non interactive lottery system used in micropayments [MR02] The lottery organizer commits to a VRF by publishing the public key PK . Any participant is allowed to choose his lottery ticket x by himself and send it to the organizer (with the only requirement that x was not used before) The value y = F SK (x) somehow determines whether the user has won ....
Silvio Micali and Ronald Rivest. Micropayments revisited. In Bart Preneel, editor, Progress in Cryptology --- CT-RSA 2002, volume 2271 of Lecture Notes in Computer Science. Springer-Verlag, February 18-22 2002.
Peppercoin Micropayments - Ronald Rivest Computer (2004) (2 citations) Self-citation (Rivest) (Correct)
No context found.
S. Micali and R. L. Rivest. Micropayments revisited. In B. Preneel, editor, Proc. Cryptography Track at RSA Conference
Signature Schemes and Applications to Cryptographic Protocol.. - Lysyanskaya (2002) (6 citations) Self-citation (Rivest) (Correct)
....bits, and yet there is a mechanism to convince a third party that all these bits came from the same source. This has proved useful in the design of resettable zero knowledge proof protocols [MR01, Rey01] Another interesting application of veri able random functions, due to Micali and Rivest [MR02] is their use in non interactive lottery systems that in turn are used for micropayments. Here, the lottery organizer holds a public key PK of a VRF. A participant creates his lottery ticket t himself and sends it to the organizer. The organizer computes the value of the veri able random ....
....to an exponential number of random looking bits, which can be of use in protocols. For example, using veri able random functions, one can reduce the number of rounds for resettable zero knowledge proofs to 3 in the bare model [MR01] Another example application, due to Micali and Rivest [MR02] is a non interactive lottery system used in micropayments. Here, the lottery organizer holds a public key PK of a VRF. A participant creates his lottery ticket t himself and sends it to the organizer. The organizer computes the value y = F PK (t) on the lottery ticket, and the corresponding ....
Silvio Micali and Ronald L. Rivest. Micropayments revisited. In Bart Preneel, editor, Proceedings of the Cryptographer's Track at the RSA Conference, volume 2271 of Lecture Notes in Computer Science, pages 149-163. Springer Verlag, 2002.
Quantifying Security in Hybrid Cellular - Networks Markus Jakobsson (Correct)
No context found.
Micali S., Rivest R.: Micropayments Revisited. CT-RSA (2002) 149--163
Secure Reporting of Traffic Forwarding Activity in Mobile.. - Heesook Choi William (Correct)
No context found.
S. Micali and R. Rivest. Micropayments Revisited. CT-RSA, 2002.
A Verifiable Random Function with Short Proofs and Keys - Dodis, Yampolskiy (2004) (5 citations) (Correct)
No context found.
Silvio Micali and Ronald L. Rivest. Micropayments revisited. In CT-RSA, pages 149-163, 2002.
SORI: A Secure and Objective Reputation-based Incentive.. - He, Wu, Khosla (2004) (2 citations) (Correct)
No context found.
S. Micali and R. Rivest, "Micropayments revisited," Proceedings of the Cryptographer's Track at the RSA Conference 2002.
A Secure Incentive Architecture for Ad-hoc Networks - He, Wu, Khosla (Correct)
No context found.
S. Micali and R. Rivest, "Micropayments revisited," Proceedings of the Cryptographer's Track at the RSA Conference 2002.
Large-Scale Pay-As-You-Watch for Unicast and.. -.. (Correct)
No context found.
S. Micali and R. L. Rivest, "Micropayments revisited" in Topics in Cryptology - CT-RSA 2002, LNCS 2271, Berlin: Springer-Verlag, pp. 149-163, 2002.
Game Theoretic Modeling of WiFi Pricing - Musacchio, Walrand (2003) (Correct)
No context found.
Silvio Micali and Ronald L. Rivest, "Micropayments revisited," in CT-RSA, 2002, pp. 149--163.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC