717 reputation
419
bio website lamontconsulting.com
location New York, NY
age 38
visits member for 3 years, 6 months
seen Jan 21 at 12:40

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


May
22
accepted How much data can I encrypt with AES before I need to change the key in CBC mode?
May
22
comment How much data can I encrypt with AES before I need to change the key in CBC mode?
Part 2 - Could this "risk" be explained to management as the quantity of brute force attempts that we will tolerate? (substitute brute force for X chosen message attacks etc) and 2^64 is the minimum required due diligence?
May
22
comment How much data can I encrypt with AES before I need to change the key in CBC mode?
Part 1 - Could this number (1/2^32) be compared to a Birthday Attack, where the distribution is non-uniform? Namely, where there there is tipping point of where 0.. to some negligible number increases rapidly to a non-negligible number?
May
21
revised How much data can I encrypt with AES before I need to change the key in CBC mode?
added 6 characters in body
May
21
comment How much data can I encrypt with AES before I need to change the key in CBC mode?
@curious Yes, they are from his coursera course. It's really good and packed full of information. I discovered this 2 weeks ago and am trying to finish all the classes in 1 month so I can start the next one on time.
May
21
revised How much data can I encrypt with AES before I need to change the key in CBC mode?
added 35 characters in body
May
21
revised How much data can I encrypt with AES before I need to change the key in CBC mode?
added 177 characters in body
May
21
asked How much data can I encrypt with AES before I need to change the key in CBC mode?
May
21
awarded  Popular Question
May
18
comment Generating IV in TLS 1.2
I'd be curious to see your C# implementation. Do share a link if you can.
May
18
comment When truncating an AES MAC value by “w” , how do I justify that “w” is still negligible?
I learned something new today en.wikipedia.org/wiki/Asymptotic_security
May
17
comment When truncating an AES MAC value by “w” , how do I justify that “w” is still negligible?
Is it correct for me to think/say "negligible in terms of brute forcing". Does negligible apply to any other attack other than brute forcing?
May
17
asked When truncating an AES MAC value by “w” , how do I justify that “w” is still negligible?
Apr
22
comment LT codes with Homomorphic hashing
Dumb question: What does the symbol ⊕ mean?
Apr
11
comment How can two UProve token holders prove to a 3rd party that they aren't the same user?
I see it here.. will read it. en.wikipedia.org/wiki/Blind_signature
Apr
11
comment How can two UProve token holders prove to a 3rd party that they aren't the same user?
I'm very interested in learning how this would operate, though the Wiki page for ecash is of no use, and all the pages are dead. Do you have any more info or references so I can understand what you mean by a "blind signature on a serial number"... and it's removal?
Mar
27
comment How can two UProve token holders prove to a 3rd party that they aren't the same user?
So that means the issuer needs N attributes, and selectively disclosing them one by one? I suppose I need to mention that the quantity of locations the UProve user will be dealing with numbers in the the millions. A UProve token with just 255 proofs takes quite a long time to generate. I hope there is another solution.
Mar
27
asked How can two UProve token holders prove to a 3rd party that they aren't the same user?
Mar
20
comment What crypto system allows for 3 parties: Party 1 who makes an assertion, Party 2 mutates the assertion, Party 3 validates it
This is very helpful and is a great starting point for my independent studies (even the terms are helpful). Since the Key based approach is based on RSA primes, and I'm trying to integrate with UProve (based on the intractable discrete logarithm problem) is it possible to adapt your line of thinking into this type of mathematical foundation? I'm doing thought experiments on using UProve to display a constant to Alice1 and a different constant when speaking to Alice2... AliceN. Charlie could deduce Bobs ID across every Alice, but the consortium of Alice's couldn't do the same without Bob.
Mar
19
comment Hashing or encrypting twice to increase security?
FYI - This answer was referenced on Bitcoin.SE