No offence taken.
As next steps, I've installed Yomichan and I plan on purchasing a copy of Genki I.
Thank you very much for the pointers!
If I can chime in, I have made NHK Easier to help practicing on stories from NHK News Web Easy.
Readit Newsyoha commented on Facebook Still Tracks People on Yelp, Duolingo, Indeed privacyinternational.org/... · Posted by u/hadrien01
Deleted Comment
So in your opinion the problem is (theoretically) solved? As in, we can have anonymous, verifiable, online, direct democracy such that 3rd parties cannot verify your vote without your private key?
As I said in another comment, individual verifiability and non-coercion are mutually exclusive online. However, there are indeed solutions for the other properties (including global integrity), and compromises between individual verifiability and non-coercion. For instance, you can have a look at Helios [1] or Belenios [2]. Current research is looking for stronger guarantees, a better compromise, or a more interesting voting system (such as Single Transferable Vote or Majority Judgment).
>but allows individual voters to verify that their votes are counted correctly.
If everyone can prove how they voted it becomes much easier to intimidate or incentivize people to vote a certain way.
That is indeed the main issue with verifiable voting. The usual solutions offer various compromises, but it is not possible to both guarantee the ability to verify that one's ballot is counted correctly, and that you cannot prove for whom you voted.
I trust good digital voting systems more than a paper ballot.
Specifically, the system should be auditable in a way that makes it difficult to trace individual votes back to voters, but allows individual voters to verify that their votes are counted correctly.
There must be a good way to accomplish this while also addressing potential voter fraud. Does anybody know of any research in this area?
With paper ballots, I have no way of knowing whether or not my vote was counted correctly. And I find that really unsettling.
Yes, it's possible, and it is an area of research in cryptography. For instance, have a look at Helios and Belenios.
That's only possible if you sacrifice some of the stronger anonymity requirements. In theory you shouldn't be able to prove you voted a particular way to ensure you can't be intimidated into changing you vote.
Unless it's good enough to verify whether your vote was counted, that should be fairly easy to do.
> That's only possible if you sacrifice some of the stronger anonymity requirements
Untrue. You can use strong encryption to ensure confidentiality and zero-knowledge proofs to ensure integrity. Then, you can use methods from homomorphic encryption to tally the ballots. There is a whole area of research dedicated to this.
yoha commented on Baffling ABC maths proof now has impenetrable 300-page ‘summary’ newscientist.com/article/... · Posted by u/ColinWright
> After six years of work, he announced the proof in 1998
then
> plan to formalize his proof ... estimated it would take 20 years
so is it just me, or is the "work" of the normal proof only took 1/5th of the time it took for the automated/formalized proof?! that seems counter-productive imho...
"Automated proof" means that the verification is automated. Actually automating the process of finding proofs is still mostly an open problem.
Formal proof software will help you on small stuff, but you will still do most of the work, and you have to go much more in details, so it takes much more time.
Deleted Comment
EDIT: WIRED article just in. Haven't read it yet. Link if anyone is interested: https://www.wired.com/story/a-programmer-solved-a-20-year-ol...
EDIT2: forgot to tell but the mining pool Antpool posted a message in the block header / coinbase data of Bitcoin's block 573138 saying "Congrats Bernard Fabrot for solving LCS35!". My brother tried to time this with the press release which was supposed to come out on friday but then the press release got pushed back to today/monday. So yeah, coinbase data of block 573 138 is kinda very cool (it requires cooperation of a mining pool because it's not just in a transaction but in a block). TYVM to the everybody at Antpool! Big thanks for that : )