swordswinger12

17 ms·

91.
IACR open letter on Australia's DTCA(iacr.org)
2 points by swordswinger12 11y ago|0 comments
92.
by swordswinger12 11y ago
Did you even read the article before posting that?
93.
by swordswinger12 11y ago
It is not absolutely essential to do anything of the sort - that's one of the central arguments of the post-structuralist movement in critical theory: http://en.wikipedia.org/wiki/Post-structuralism#General_prac...
94.
by swordswinger12 11y ago
>authenticates with HMAC to protect against adaptive chosen-ciphertext attacks Okay... >TripleSec "macs" with a concatenation of two HMACs: HMAC-SHA-512, and HMAC-SHA3 Why?
95.
by swordswinger12 11y ago
>If a quantum computer could be built with just 50 quantum bits (qubits), no combination of today's TOP500 supercomputers could successfully outperform it. I would really, really like to know how they came up with this.
96.
by swordswinger12 11y ago
Is Go's AES-based hash function supposed to be a cryptographic hash? If so, did they use a standard transform (e.g. Davies-Meyer) for this task or roll their own?
97.
by swordswinger12 12y ago
I didn't ask whether you use deterministic encryption, I asked whether your variant of mOPE is deterministic. It's possible to use randomized encryption for the leaves of mOPE and still construct a deterministic OPF. EDIT: Also, y
98.
by swordswinger12 12y ago
How do you handle joins?
99.
by swordswinger12 12y ago
So you use a scheme similar to mOPE? How do you handle tree rebalancing? Is your variant of mOPE deterministic?
100.
by swordswinger12 12y ago
This paper is great and contains some really interesting historical examples of backdoored crypto. For example, Lotus Notes 4 circumvented export controls by using a 64-bit key but taking the first 24 bits and encrypting them with a public
101.
by swordswinger12 12y ago
To say that something is reducible to a conjectured hard problem is what 'provably secure' means in cryptography. Also, cryptographic hardness is not trivially relatable to P vs. NP, especially for hardness assumptions used to bui
102.
by swordswinger12 12y ago
I went to high school with this guy!
103.
by swordswinger12 12y ago
>>>This network was designed to camouflage all communications... using RSA 128-bit encryption So it used RSA that I can break on my TI-83? Is this a typo?
104.
by swordswinger12 12y ago
I'm curious if it's possible to use this to execute a Bellcore-type fault injection attack against RSA signatures.
105.
by swordswinger12 12y ago
I don't care that I'm beating a dead horse here - if you haven't read Andrew Hodges' excellent biography of Alan Turing, you should put it on your holiday reading list. Link: http://www.amazon.com/Alan-Tu
106.
by swordswinger12 12y ago
For those of you who read this and were confused by its lack of context, the background is as follows: Koblitz and Menezes have, for the last two decades or so, been publishing a series of papers that invite the cryptographic community to r
107.
by swordswinger12 12y ago
Side rant: I really hate that people conflate expertise in math with expertise in crypto. Dozens of completely useless cryptosystems are published every year by talented mathematicians.
108.
by swordswinger12 12y ago
You guys build all the hardware - why not just use one of the pre-shared key TLS ciphersuites? No expensive public-key crypto required, just AES and SHA.
109.
by swordswinger12 12y ago
Nobody deserves it 'more' but another person who has been doing similarly groundbreaking stuff is Sanjam Garg.
110.
by swordswinger12 12y ago
I can think of few people who deserve it more. His recent work has been truly groundbreaking. Not just on FHE, either - multilinear maps, IO, lattices... I could go on. Just a brilliant dude.
111.
by swordswinger12 12y ago
Which is especially silly in this case because there is some pretty cool research that comes out of Walmart Labs. Most of what's relevant to me is the applied crypto/searchable encryption stuff.
112.
by swordswinger12 12y ago
Any benchmarks? I am very interested in this, it looks really cool!
113.
by swordswinger12 12y ago
In the description of the key exchange mechanism (section 'Conversation Keys' under 'Security') it sounds like they're using one symmetric key for both directions of a two-way channel. If true, this is a pretty seri
114.
by swordswinger12 12y ago
There is no contradiction. You are conflating the concept of 'obfuscation' and the very specific (and rigidly formalized) cryptographic primitive called 'indistinguishability obfuscation'.
115.
by swordswinger12 12y ago
The details are more complicated, but he/she might be talking about http://eprint.iacr.org/2013/229.pdf
116.
by swordswinger12 12y ago
Think of it this way - any (current) crypto solution is likely to be much slower and more bandwidth-intensive than simply re-uploading the file every time they change something. In theory you could also use a secure multiparty computation s
117.
by swordswinger12 12y ago
That 'something' is virtual black-box indistinguishability obfuscation. It's a way of 'hiding' (in some sense) a program rather than the data a program acts on. FHE is a way of carrying out any program over encr
118.
by swordswinger12 12y ago
This is talking about a completely different primitive (indistinguishability obfuscation) so FHE is fine. In fact this is talking about an exceptionally strong characterization of IO (virtual black-box) which is not used in current research
119.
by swordswinger12 12y ago
I can verify their existence, but you don't need to take my word for it - much of the research on fully homomorphic encryption is publicly available through the IACR's online preprint database, http://eprint.iacr.org .
120.
by swordswinger12 12y ago
Have any real multilinear map constructions been discovered? I thought all extant ones were approximations, e.g. graded encoding schemes.

More ›