Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine
 
PerlMonks  

Re: Single use Only

by arhuman (Vicar)
on Jan 02, 2002 at 19:22 UTC ( #135686=note: print w/replies, xml ) Need Help??


in reply to Avoiding multiple voting

I think the monastery use an IP based system,
but it's not foolproof and you will block all the people behind the same router
(in the case of lan doing NAT behind a router )
after the first vote...

Forget cookies or UserAgent or referers...(too easy to delete/fake IMHO)

A possible way could be to have a challenge with one part computed by the client (java class?)
with client hardware's info as part of the computation to ensure uniqueness
I've never went into this although, I was just wondering...

UPDATE : To step away from theory, and give more details :
  • Don't forget to store somewhere those who have already voted
  • A challenge to prevent replay attacks
  • using client hardware's info (MAC address,CPU ID in some case,DMPI/BIOS info...) for uniqueness
  • Java class for client side (and WEAK obfuscation)

"Only Bad Coders Code Badly In Perl" (OBC2BIP)

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://135686]
help
Chatterbox?
[ambrus]: Sometimes it's easier to just match elements in ways other than xpath, like directly with perl code.
[marto]: this is a cheap hack, a script that doesn't need to run for long, using WWW::Mechanize:: Firefox to drive some awful interface.
[marto]: if it were anything more serious I'd spend more time looking into it properly :P

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (8)
As of 2016-12-08 10:58 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    On a regular basis, I'm most likely to spy upon:













    Results (140 votes). Check out past polls.