Re: One per customer
This WebDNA talk-list message is from 2000
It keeps the original formatting.
numero = 27608
interpreted = N
texte = Kenneth Grome at ken@simplewebstores.com said this on 2/15/00 11:12 PM>Yes, there are LOTS of non-webcat methods for *trying* to prevent people >from voting more than once, but I don't think there is any sure-fire way >of guaranteeing it ...True. DigitalSignatures from a trusted third party can help, given that party verifies id with another hard to forge form of id... basically you can only trust (people or computers) so far... or look at it the otherway and simply trust people period -- or balance the cost of your need for one per customer with a cash equivalency.If it's random people vs. pre-registered (a class, for instance, or a large group of known voters) , the pre-registered group is clearly easier. You can assign a unique key to each vistor who registers, etc.Back to just trust is likely good enough. We have a Shockwave-based app that limits multiple voting, but you CAN get around it with not too much work. Having a little obscurity (embedded in Shockwave) is a small deterent. A compiled Java App would do about as well with the general public. Real security doesn't get too far though, by obscuring computations behind code.David-------------------------------------------------------------Brought to you by CommuniGate Pro - The Buzz Word Compliant Messaging Server.To end your Mail problems go to
.This message is sent to you because you are subscribed to the mailing list .To unsubscribe, E-mail to: To switch to the DIGEST mode, E-mail to
Associated Messages, from the most recent to the oldest:
Kenneth Grome at ken@simplewebstores.com said this on 2/15/00 11:12 PM>Yes, there are LOTS of non-webcat methods for *trying* to prevent people >from voting more than once, but I don't think there is any sure-fire way >of guaranteeing it ...True. DigitalSignatures from a trusted third party can help, given that party verifies id with another hard to forge form of id... basically you can only trust (people or computers) so far... or look at it the otherway and simply trust people period -- or balance the cost of your need for one per customer with a cash equivalency.If it's random people vs. pre-registered (a class, for instance, or a large group of known voters) , the pre-registered group is clearly easier. You can assign a unique key to each vistor who registers, etc.Back to just trust is likely good enough. We have a Shockwave-based app that limits multiple voting, but you CAN get around it with not too much work. Having a little obscurity (embedded in Shockwave) is a small deterent. A compiled Java App would do about as well with the general public. Real security doesn't get too far though, by obscuring computations behind code.David-------------------------------------------------------------Brought to you by CommuniGate Pro - The Buzz Word Compliant Messaging Server.To end your Mail problems go to .This message is sent to you because you are subscribed to the mailing list .To unsubscribe, E-mail to: To switch to the DIGEST mode, E-mail to
David M. Dantowitz
DOWNLOAD WEBDNA NOW!
Top Articles:
Talk List
The WebDNA community talk-list is the best place to get some help: several hundred extremely proficient programmers with an excellent knowledge of WebDNA and an excellent spirit will deliver all the tips and tricks you can imagine...
Related Readings:
db error (2003)
[BULK] RE: [WebDNA] RE: Error. WebDNA (version 5.1g or later) is not running. (2012)
nested context (1998)
Resume Catalog ? (1997)
Multiple Passwords (1997)
Automatic thumbnail images (1998)
Help! WebCat2 bug (1997)
Authorize net down? (2005)
WebCat2b12--[searchstring] bug (1997)
[WebDNA] V8.6 FCGI (2018)
Chown www:wheel Almost There WebCat 5 on itools 7 (2003)
RE: SSL and WebCatalog (1997)
HELP WITH DATES (1997)
back one? (2000)
unable to launch acgi in WebCat (1997)
Emergency Error (2000)
WebCat2b13 Command Reference Doc error (1997)
WC2b12: Yes, Formulas.db is for real (1997)
What's New In WebCatalog 3.0.7 (2000)
Replace context problem ... (1997)