126 reputation
3
bio website
location
age
visits member for 1 year
seen Mar 21 at 18:22

Jan
3
comment What crypto system allows for 3 parties: Party 1 who makes an assertion, Party 2 mutates the assertion, Party 3 validates it
You can use a custom or modified SAML, or SAML 1.0. The identity provider authenticates you and signs an assertion with its private key. You may then present that assertion to any service that trusts the identity provider. If the service trusts the identity provider (Google/Yahoo), then it can verify the assertion with the identity provider's public key to know you were correct authenticated. The identity provider needn't know to whom you present its assertion, but normally it is auto-submitted to the service for ease.
Sep
27
comment How does Dissent protect against Sybil Attacks?
@D.W. Thanks. Found it. They are assuming closed, non-public groups. I was considering forums public. We assume a group’s membership is closed and known to its members; Their idea of anonymity is a bit limited. The papers are so dense, I thought I could get an idea from the slides, at least from 3 different sets.
Aug
27
comment Is there a cryptographic function or system in which it becomes HARDER to break as time passes?
Lol! ..........
Aug
27
comment How much would it cost in U.S. dollars to brute force a 256 bit key in a year?
So I made a spreadsheet with various costs based on an answer below. It would take \$1 trillion to crack 102 bit key, but only \$1000 to crack a 73 bit key. Here is the sheet: docs.google.com/spreadsheet/…
Aug
27
comment How much would it cost in U.S. dollars to brute force a 256 bit key in a year?
So I made a spreadsheet with various costs. It would take \$1 trillion to crack 102 bit key, but only \$1000 to crack a 73 bit key. I could not find a source for your decryptions/s. Here is the sheet: docs.google.com/spreadsheet/…