Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > sci.physics > #521903 > unrolled thread

Near-Perfect Computer Security May Be Surprisingly Close

Started bySam Wormley <swormley1@gmail.com>
First post2015-09-18 17:45 -0500
Last post2015-09-18 22:57 +0000
Articles 2 — 2 participants

Back to article view | Back to sci.physics


Contents

  Near-Perfect Computer Security May Be Surprisingly Close Sam Wormley <swormley1@gmail.com> - 2015-09-18 17:45 -0500
    Re: Near-Perfect Computer Security May Be Surprisingly Close jimp@specsol.spam.sux.com - 2015-09-18 22:57 +0000

#521903 — Near-Perfect Computer Security May Be Surprisingly Close

FromSam Wormley <swormley1@gmail.com>
Date2015-09-18 17:45 -0500
SubjectNear-Perfect Computer Security May Be Surprisingly Close
Message-ID<ON-dnbri3fZyDmHInZ2dnUU7-TWdnZ2d@giganews.com>
Near-Perfect Computer Security May Be Surprisingly Close
> http://www.wired.com/2015/09/new-design-cryptographys-black-box/


> In July 2013 a pair of studies set the cryptography world on fire.
> They were posted within days of one another to an online archive
> where researchers share their work, and together they described a
> powerful new method for hiding the secrets inside software programs.
>
> Original story reprinted with permission from Quanta Magazine, an
> editorially independent division of the Simons Foundation whose
> mission is to enhance public understanding of science by covering
> research developments and trends in mathematics and the physical and
> life sciences

> The method was called “indistinguishability obfuscation,” or IO. The
> authors touted it as a “central hub” for all of cryptography—a
> unified basis upon which to reconstruct familiar cryptographic tools
> like public keys and selectively secure signatures. The papers also
> took a first stab at demonstrating what IO might look like
> mathematically.
>
> The research produced a flurry of interest at the time, but in the
> two years since the announcement, computer science researchers have
> encountered a number of practical challenges that stand in the way of
> using IO. For one thing, IO is extraordinarily slow. Obfuscating a
> program adds delays that would be measured not in minutes or hours,
> but in lifetimes. In addition, the method is not nearly as
> mathematically secure as it needs to be.



-- 

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]


#521911

Fromjimp@specsol.spam.sux.com
Date2015-09-18 22:57 +0000
Message-ID<nghucc-6oa.ln1@mail.specsol.com>
In reply to#521903
Sam Wormley <swormley1@gmail.com> wrote:
> Near-Perfect Computer Security May Be Surprisingly Close

Which might be nice if it actually happened but has nothing to do
with physics, shit head.


-- 
Jim Pennino

[toc] | [prev] | [standalone]


Back to top | Article view | sci.physics


csiph-web