672 reputation
419
bio website lamontconsulting.com
location New York, NY
age 38
visits member for 3 years, 3 months
seen Nov 11 at 17:24

SSL isn't good enough. Your website can be hacked.
Help solve the problem by advocating these RFCs:

TLSA (formerly DANE for DNS) Fixes the hackable CA problem

TLS-OBC: Fixes TLS, and the Related Domain Cookie Attack


About me
I have no relation to the above sites; I am just an advocate

Why "makerofthings7"? It's a challenge to "make seven things in my life of significant quality and value". Who knows if those things will take the form of software, art, or people. (I'm not married, no kids yet)

See ...my LinkedIn profile


Mar
12
comment What crypto system allows for 3 parties: Party 1 who makes an assertion, Party 2 mutates the assertion, Party 3 validates it
How much depth should you go into? I admit I'm not that well versed in all the mathematics (and symbols) of cryptography but I will study whatever you share until I understand it completely/100%. I'll study the 101 terminology wherever it's offered.
Mar
12
comment What crypto system allows for 3 parties: Party 1 who makes an assertion, Party 2 mutates the assertion, Party 3 validates it
@RickyDemer If Bob did publish something, Alice shouldn't know it, or shouldn't be able to use it for anything useful, lest Bob's purchases get correlated (Sweaters, and amazon purchases). There should be something that prevents forwarding Bob's credentials. One idea is Alice should send a challenge to Bob, (so the exchange is bound to the current session) and Bob sends Charlie's verification (of Bob's relative age and address) to Alice.
Mar
12
revised What crypto system allows for 3 parties: Party 1 who makes an assertion, Party 2 mutates the assertion, Party 3 validates it
added 509 characters in body
Mar
12
revised What crypto system allows for 3 parties: Party 1 who makes an assertion, Party 2 mutates the assertion, Party 3 validates it
added 301 characters in body
Mar
12
asked What crypto system allows for 3 parties: Party 1 who makes an assertion, Party 2 mutates the assertion, Party 3 validates it
Feb
14
awarded  Critic
Feb
11
accepted How do other, non-RSA algorithms, compare to the PKCS #1 standard?
Feb
11
awarded  Popular Question
Dec
15
comment Is there a field guide to ECC for the IT Security layman?
@Thomas FYI The +3 votes came from Security.SE, not the more discriminating Crypto.SE site, who could (and probably already did) write a book on this. I'd have to think about how to slice this up, but feel free to edit as you think ...
Dec
14
revised Is there a field guide to ECC for the IT Security layman?
migrated to new site... get new tags
Dec
14
asked Is there a field guide to ECC for the IT Security layman?
Nov
26
asked Learning cryptography using a FPGA
Aug
4
awarded  Yearling
Jul
2
awarded  Commentator
Jul
2
comment Does a high exponent compensate for a low degree of certainty?
Suppose I want to create that situation, I'd need a low exponent? How low would be appropriate?
Jul
2
accepted How can I protect against the failure of a block or symmetric cipher?
Jul
2
accepted Impacts of not using RSA exponent of 65537
Jul
2
asked Does a high exponent compensate for a low degree of certainty?
Jul
2
accepted What is the correct value for “certainty” in RSA key pair generation?
Jul
1
revised Impacts of not using RSA exponent of 65537
added 112 characters in body