Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > sci.physics > #521916 > unrolled thread
| Started by | Sam Wormley <swormley1@gmail.com> |
|---|---|
| First post | 2015-09-18 18:24 -0500 |
| Last post | 2015-09-19 14:09 -0400 |
| Articles | 4 — 4 participants |
Back to article view | Back to sci.physics
A New Design for Cryptography’s Black Box Sam Wormley <swormley1@gmail.com> - 2015-09-18 18:24 -0500
Re: A New Design for Cryptography’s Black Box jimp@specsol.spam.sux.com - 2015-09-19 01:17 +0000
Re: A New Design for Cryptography's Black Box Michael Strickland <michael06582@comcast.net> - 2015-09-19 02:00 -0700
Re: A New Design for Cryptography's Black Box benj <none@gmail.com> - 2015-09-19 14:09 -0400
| From | Sam Wormley <swormley1@gmail.com> |
|---|---|
| Date | 2015-09-18 18:24 -0500 |
| Subject | A New Design for Cryptography’s Black Box |
| Message-ID | <ON-dnbHi3faEAGHInZ2dnUU7-TWdnZ2d@giganews.com> |
A New Design for Cryptography’s Black Box > https://www.quantamagazine.org/20150902-indistinguishability-obfuscation-cryptographys-black-box/ > A two-year-old cryptographic breakthrough has proven difficult to put > into practice. But new advances show how near-perfect computer > security might be surprisingly close at hand. > Indistinguishability obfuscation begins by positing two programs that > compute the exact same outputs by different methods — for example, > the equivalent functions f(x) = x(a + b) and f(x) = ax + bx. For any > set of three inputs — a, b and x — each program produces the same > result as the other, but arrives at that result by a different path. > IO says that given two equivalent programs, it should be possible to > encrypt them so that users cannot tell which version they have, no > matter how much they poke around. > -- sci.physics is an unmoderated newsgroup dedicated to the discussion of physics, news from the physics community, and physics-related social issues.
[toc] | [next] | [standalone]
| From | jimp@specsol.spam.sux.com |
|---|---|
| Date | 2015-09-19 01:17 +0000 |
| Message-ID | <tmpucc-qib.ln1@mail.specsol.com> |
| In reply to | #521916 |
Sam Wormley <swormley1@gmail.com> wrote: > A New Design for Cryptography?s Black Box >> https://www.quantamagazine.org/20150902-indistinguishability-obfuscation-cryptographys-black-box/ > >> A two-year-old cryptographic breakthrough has proven difficult to put >> into practice. But new advances show how near-perfect computer >> security might be surprisingly close at hand. Yeah, sure, any day now, shit head, not that it has anything to do with physics. -- Jim Pennino
[toc] | [prev] | [next] | [standalone]
| From | Michael Strickland <michael06582@comcast.net> |
|---|---|
| Date | 2015-09-19 02:00 -0700 |
| Subject | Re: A New Design for Cryptography's Black Box |
| Message-ID | <47d30d88-6d92-4ba4-b309-24e717988b74@googlegroups.com> |
| In reply to | #521916 |
On Friday, September 18, 2015 at 7:24:13 PM UTC-4, Sam Wormley wrote: > A New Design for Cryptography's Black Box > > https://www.quantamagazine.org/20150902-indistinguishability-obfuscation-cryptographys-black-box/ > > > A two-year-old cryptographic breakthrough has proven difficult to put > > into practice. But new advances show how near-perfect computer > > security might be surprisingly close at hand. > > > > Indistinguishability obfuscation begins by positing two programs that > > compute the exact same outputs by different methods -- for example, > > the equivalent functions f(x) = x(a + b) and f(x) = ax + bx. For any > > set of three inputs -- a, b and x -- each program produces the same > > result as the other, but arrives at that result by a different path. > > IO says that given two equivalent programs, it should be possible to > > encrypt them so that users cannot tell which version they have, no > > matter how much they poke around. > > > > > > -- > > sci.physics is an unmoderated newsgroup dedicated > to the discussion of physics, news from the physics > community, and physics-related social issues. Actually, the first method will give a faster and more accurate result since it only requires 1 multiplication and 1 addition while the second requires two multiplications and 1 addition.
[toc] | [prev] | [next] | [standalone]
| From | benj <none@gmail.com> |
|---|---|
| Date | 2015-09-19 14:09 -0400 |
| Subject | Re: A New Design for Cryptography's Black Box |
| Message-ID | <oxhLx.1388$SA5.199@fx27.iad> |
| In reply to | #521972 |
On 09/19/2015 05:00 AM, Michael Strickland wrote:
> On Friday, September 18, 2015 at 7:24:13 PM UTC-4, Sam Wormley wrote:
>> A New Design for Cryptography's Black Box
>>> https://www.quantamagazine.org/20150902-indistinguishability-obfuscation-cryptographys-black-box/
>>
>>> A two-year-old cryptographic breakthrough has proven difficult to put
>>> into practice. But new advances show how near-perfect computer
>>> security might be surprisingly close at hand.
>>
>>
>>> Indistinguishability obfuscation begins by positing two programs that
>>> compute the exact same outputs by different methods -- for example,
>>> the equivalent functions f(x) = x(a + b) and f(x) = ax + bx. For any
>>> set of three inputs -- a, b and x -- each program produces the same
>>> result as the other, but arrives at that result by a different path.
>>> IO says that given two equivalent programs, it should be possible to
>>> encrypt them so that users cannot tell which version they have, no
>>> matter how much they poke around.
>>>
>>
>>
>>
>> --
>>
>> sci.physics is an unmoderated newsgroup dedicated
>> to the discussion of physics, news from the physics
>> community, and physics-related social issues.
>
> Actually, the first method will give a faster and more accurate result since it only requires 1 multiplication and 1 addition while the second requires two multiplications and 1 addition.
>
Stop messing with Sam's brain like that! He's more into slogans than
actual thinking.
--
___ ___ ___ ___
/\ \ /\ \ /\__\ /\ \
/::\ \ /::\ \ /::| | \:\ \
/:/\:\ \ /:/\:\ \ /:|:| | ___ /::\__\
/::\~\:\__\ /::\~\:\ \ /:/|:| |__ /\ /:/\/__/
/:/\:\ \:|__| /:/\:\ \:\__\ /:/ |:| /\__\ \:\/:/ /
\:\~\:\/:/ / \:\~\:\ \/__/ \/__|:|/:/ / \::/ /
\:\ \::/ / \:\ \:\__\ |:/:/ / \/__/
\:\/:/ / \:\ \/__/ |::/ /
\::/__/ \:\__\ /:/ /
~~ \/__/ \/__/
[toc] | [prev] | [standalone]
Back to top | Article view | sci.physics
csiph-web