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


Groups > sci.physics > #529057

Re: A basis for all cryptography

From gilber34 <fafa@invalid.com>
Newsgroups sci.physics
Subject Re: A basis for all cryptography
Date 2015-10-29 21:07 -0500
Organization Aioe.org NNTP Server
Message-ID <n0ujeb$sq2$1@speranza.aioe.org> (permalink)
References <DIqdnRG0rK2fJa_LnZ2dnUU7-W8AAAAA@giganews.com>

Show all headers | View raw


On 10/29/2015 7:21 PM, Sam Wormley wrote:
> A basis for all cryptography
>> http://phys.org/news/2015-10-basis-cryptography.html#ms
>


<snip FatAssInACubeMakingStuffUp@phys.org>

fatass did not read the paper, its totally different;
(there is no summery! so it may not have been fully reviewed yet)




Indistinguishability Obfuscation from Functional Encryption

Nir Bitanskyy Vinod Vaikuntanathanz


Abstract

Indistinguishability obfuscation (IO) is a tremendous notion, powerful 
enough to give rise to almost any known cryptographic object. So far, 
candidate IO constructions were based on specific assumptions on 
algebraic objects called multi-linear graded encodings. We present a 
generic construction of indistinguishability obfuscation from public-key 
functional encryption with succinct ciphertexts and sub-exponential 
security. This shows the equivalence of indistinguishability obfuscation 
and public-key functional encryption, a primitive that has so far seemed 
to be much weaker, lacking the power and the staggering range of 
applications of indistinguishability
obfuscation.

As an application, we obtain a new candidate IO construction based on 
the functional encryption scheme of Garg, Gentry, Halevi, and Zhandry 
[Eprint 14] under their assumptions on multi-linear graded encodings. We 
also show that, under the Learning with Errors assumptions, our 
techniques imply that any indistinguishability obfuscator can be 
converted to one where obfuscated circuits are of linear size in the 
size of the original circuit plus a polynomial overhead in its depth. 
Our reduction highlights the importance of ciphertext succinctness in 
functional encryption schemes, which we hope will serve as a pathway to 
new IO constructions based on solid cryptographic
foundations.


Back to sci.physics | Previous | NextPrevious in thread | Next in thread | Find similar | Unroll thread


Thread

A basis for all cryptography Sam Wormley <swormley1@gmail.com> - 2015-10-29 19:21 -0500
  Re: A basis for all cryptography benj <nobody@gmail.com> - 2015-10-29 21:39 -0400
    Re: A basis for all cryptography xxein1@att.net - 2015-10-29 21:03 -0700
  Re: A basis for all cryptography gilber34 <fafa@invalid.com> - 2015-10-29 21:07 -0500
    Re: A basis for all cryptography Fabian Russell <root@localhost.localdomain> - 2015-10-30 02:31 +0000
      Re: A basis for all cryptography xxein1@att.net - 2015-10-29 21:10 -0700
        Re: A basis for all cryptography Fabian Russell <root@localhost.localdomain> - 2015-10-30 04:43 +0000
          Re: A basis for all cryptography xxein1@att.net - 2015-10-30 00:07 -0700
  Re: A basis for all cryptography jimp@specsol.spam.sux.com - 2015-10-30 05:21 +0000
    Re: A basis for all cryptography Sam Wormley <swormley1@gmail.com> - 2015-10-30 08:09 -0500
      Re: A basis for all cryptography jimp@specsol.spam.sux.com - 2015-10-30 17:05 +0000

csiph-web