5,938 Hits in 3.9 sec

Functional Encryption for Turing Machines [chapter]

Prabhanjan Ananth, Amit Sahai
2015 Lecture Notes in Computer Science  
In this work, we construct an adaptively secure functional encryption for Turing machines scheme, based on indistinguishability obfuscation for circuits.  ...  More specifically, previous work (implicitly) achieved selectively secure FE for Turing machines with a-priori bounded input based on indistinguishability obfuscation (STOC 2015), or achieved FE for general  ...  Acknowledgements We thank Brent Waters for collaboration at early stages of this project and several discussions.  ... 
doi:10.1007/978-3-662-49096-9_6 fatcat:i2kqtwebtfecta4o42po7mrhxi

How to Run Turing Machines on Encrypted Data [chapter]

Shafi Goldwasser, Yael Tauman Kalai, Raluca Ada Popa, Vinod Vaikuntanathan, Nickolai Zeldovich
2013 Lecture Notes in Computer Science  
-A (single-key and succinct) functional encryption scheme for any polynomialtime Turing machine. -A reusable garbling scheme for any polynomial-time Turing machine.  ...  As of today, almost all known schemes for fully homomorphic encryption, functional encryption, and garbling schemes work by modeling algorithms as circuits rather than as Turing machines.  ...  Acknowledgments We would like to thank the authors of the witness encryption paper [GGH13a] and Zvika Brakerski for useful discussions.  ... 
doi:10.1007/978-3-642-40084-1_30 fatcat:evgkrnr5mvaynhfw3iqwhfm57a

Blind Turing-Machines: Arbitrary Private Computations from Group Homomorphic Encryption

Stefan Rass
2013 International Journal of Advanced Computer Science and Applications  
In this work, we introduce the concept of a blind Turing-machine, which uses simple homomorphic encryption (an extension of ElGamal encryption) to process ciphertexts in the way as standard Turing-machines  ...  the function is evaluated.  ...  BLIND TURING-MACHINES Informally, a blind Turing-machine (BTM) is a normal TM, having its tape alphabet and transition function encrypted under a homomorphic public-key encryption with plaintext equality  ... 
doi:10.14569/ijacsa.2013.041107 fatcat:u4qdqzs2jfd5xptu32qfdfgevi

On Extractability Obfuscation [chapter]

Elette Boyle, Kai-Min Chung, Rafael Pass
2014 Lecture Notes in Computer Science  
Functional Witness Encryption.  ...  (FOCS 2013), we show how to bootstrap the obfuscator for N C 1 to an obfuscator for all non-uniform polynomial-time Turing machines.  ...  We remark that, in particular, Theorem 6.9 gives a method for transforming indistinguishability FWE for the trivial function f (m, w) = m to FWE for the same function f .  ... 
doi:10.1007/978-3-642-54242-8_3 fatcat:3khqmnbqjbcw5jqiwbflbd62ui

Indistinguishability Obfuscation with Non-trivial Efficiency [chapter]

Huijia Lin, Rafael Pass, Karn Seth, Sidharth Telang
2016 Lecture Notes in Computer Science  
Such inefficient obfuscators, however, are not useful for applications.  ...  We show that, perhaps surprisingly, under the subexponential LWE assumption, subexponentially-secure XiO for polynomial-size circuits implies (polynomialtime computable) iO for all polynomial-size circuits  ...  The trojan method in functional encryption: From selective to adaptive security. Technical report, generically. Cryptology ePrint Archive, Report 2014/917, 2014.  ... 
doi:10.1007/978-3-662-49387-8_17 fatcat:vjtkpxqrkzdpreb7pncx73l3j4

Random-Oracle Uninstantiability from Indistinguishability Obfuscation [chapter]

Christina Brzuska, Pooya Farshim, Arno Mittelbach
2015 Lecture Notes in Computer Science  
To this end, we build on the recent work of Brzuska, Farshim and Mittelbach (CRYPTO 2014) and rely on the existence of iO for circuits or iO for Turing machines to derive uninstantiability for hash functions  ...  (ICDCS 2002) for obtaining KDM-secure encryption and de-duplication schemes respectively.  ...  For our purposes, the crucial difference between iO for circuits and iO for Turing machines is that an obfuscated Turing machine is still a Turing machine and can process inputs of arbitrary length.  ... 
doi:10.1007/978-3-662-46497-7_17 fatcat:x4kztrpkyrgm7clzws2z26oic4

Multi-input Functional Encryption for Unbounded Arity Functions [chapter]

Saikrishna Badrinarayanan, Divya Gupta, Abhishek Jain, Amit Sahai
2015 Lecture Notes in Computer Science  
We construct such an MI-FE scheme with indistinguishability security in the selective model based on the existence of public-coin differing-inputs obfuscation for turing machines and collisionresistant  ...  The notion of multi-input functional encryption (MI-FE) was recently introduced by Goldwasser et al.  ...  This check needs to be performed by the functional key for the turing machine M .  ... 
doi:10.1007/978-3-662-48797-6_2 fatcat:coebek55srbgvkvutlxqoas4hm

Indistinguishability Obfuscation for Turing Machines: Constant Overhead and Amortization [chapter]

Prabhanjan Ananth, Abhishek Jain, Amit Sahai
2017 Lecture Notes in Computer Science  
Our results rely on the existence of sub-exponentially secure iO for circuits and re-randomizable encryption schemes.  ...  In this work, we construct the first iO scheme for (bounded-input) Turing machines that achieves only a constant multiplicative overhead in size.  ...  There exists an succinct iO scheme, assuming the existence of sub-exponentially secure iO for circuits and sub-exponentially secure re-randomizable encryption schemes (which can be based on DDH, LWE).  ... 
doi:10.1007/978-3-319-63715-0_9 fatcat:e5n22nq7czdcdbz2adcdk3kh3e

Turing machine based Cross-network Isolation and Data Exchange Theory Model

Dan Liu, Xi Chang, Sisi Wan, Jin Tang, Yongxin Cheng
2019 IEEE Access  
Therefore, this paper proposes a Turing machine-based theoretical model for cross-network isolated data exchange.  ...  INDEX TERMS Cross-network isolation, data exchange, physical transmission channel, proof system, turing machine.  ...  ACKNOWLEDGMENT The authors thank the anonymous reviewers for their helpful comments and suggestions.  ... 
doi:10.1109/access.2019.2924539 fatcat:sk2eqshzkfb25fylo2edcnfuca

The Cramer-Shoup Encryption Scheme Is Plaintext Aware in the Standard Model [chapter]

Alexander W. Dent
2006 Lecture Notes in Computer Science  
In this paper we examine the security criteria for a KEM and a DEM that are sufficient for the overall hybrid encryption scheme to be plaintext-aware in the standard model.  ...  This answers a previously open conjecture of Bellare and Palacio on the existence of plaintext-aware encryption schemes. 1.  ...  Thanks should also be given to Nigel Smart for his comments and to the anonymous referees of Eurocrypt 2006.  ... 
doi:10.1007/11761679_18 fatcat:jmydrndudvai7jlu3i7hmnnehu

Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software [chapter]

Prabhanjan Ananth, Abhishek Jain, Amit Sahai
2017 Lecture Notes in Computer Science  
We model this broadly by considering software patches P as arbitrary Turing Machines that take as input the description of a Turing Machine M , and output a new Turing Machine description M = P (M ).  ...  We show that sub-exponentially secure iO for circuits and sub-exponentially secure re-randomizable encryption schemes (Re-randomizable encryption schemes can be instantiated under standard assumptions  ...  Indeed, given an encryption (i.e., encoding) of a machine M and an encryption of a patch P , one can obtain an encryption of the patched machine M = P (M ) by homomorphically evaluating the function f  ... 
doi:10.1007/978-3-319-56617-7_5 fatcat:jl267kwoq5bndl3eepdi7nx6xm

On Dynamical Systems of Large Girth or Cycle Indicator and Their Applications to Multivariate Cryptography [chapter]

Vasyl Ustimenko, Urszula Romańczuk
2013 Studies in Computational Intelligence  
We are going to observe special algebraic Turing machines designed for different assignments of cryptography such as classical symmetric encryption, public key algorithms, problems of secure key exchange  ...  Romańczuk dynamical systems for the construction of special Turing machines for the generation of the nonlinear DLP bases of large (or hidden) order and small degree.  ...  Turing machine.  ... 
doi:10.1007/978-3-642-29694-9_10 fatcat:voi5gvpmgnegzds55voiwqp2ma

Output-Compressing Randomized Encodings and Applications [chapter]

Huijia Lin, Rafael Pass, Karn Seth, Sidharth Telang
2015 Lecture Notes in Computer Science  
iO for Turing machines is equivalent to the notion of a compact weak RE.  ...  Compact RE, on the other hand, is equivalent to puncturable iO for Turing machines (without inputs).  ...  hash functions; this results was the inspiration behind our main impossibility result.  ... 
doi:10.1007/978-3-662-49096-9_5 fatcat:ouieihstoragrhmssu5zycbkmq

Secure Information Transmission Based on Physical Principles [chapter]

Dima Grigoriev, Vladimir Shpilrain
2013 Lecture Notes in Computer Science  
The distinctive feature of this protocol, compared to all known public-key cryptographic protocols, is that neither party uses a one-way function.  ...  We employ physical properties of the real world to design a protocol for secure information transmission where one of the parties is able to transmit secret information to another party over an insecure  ...  We are also grateful to Igor Monastyrsky for consultations on physical aspects of our schemes, and to Bren Cavallo for pointing out an application of our method to Yao's "millionaires' problem".  ... 
doi:10.1007/978-3-642-39074-6_12 fatcat:pbbriir2ojgw5nknzy3kp2gc2u

Reusable garbled circuits and succinct functional encryption

Shafi Goldwasser, Yael Kalai, Raluca Ada Popa, Vinod Vaikuntanathan, Nickolai Zeldovich
2013 Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13  
call token-based obfuscation, homomorphic encryption for a class of Turing machines where the evaluation runs in input-specific time rather than worst-case time, and a scheme for delegating computation  ...  Functional encryption is an ambitious primitive: given an encryption Enc(x) of a value x, and a secret key sk f for a function f , anyone can compute f (x) without learning any other information about  ...  There is a scheme for evaluating Turing machines on encrypted inputs in input-specific time for any class of d-depth-bounded Turing machines, assuming the existence of a succinct single-key functional  ... 
doi:10.1145/2488608.2488678 dblp:conf/stoc/GoldwasserKPVZ13 fatcat:whwl6pfenzexvkgvjotuzy6uwa
« Previous Showing results 1 — 15 out of 5,938 results