2,516 Hits in 3.2 sec

On Removing Graded Encodings from Functional Encryption [chapter]

Nir Bitansky, Huijia Lin, Omer Paneth
2017 Lecture Notes in Computer Science  
Functional encryption (FE) has emerged as an outstanding concept.  ...  In the heart of our result, are new techniques for removing ideal graded encoding oracles from FE constructions.  ...  Thus, we cannot rely directly on existing results that remove ideal oracles from IO [PS16] .  ... 
doi:10.1007/978-3-319-56614-6_1 fatcat:t4iv7jrxebazvap2rynuppk3q4

Functional Encryption Without Obfuscation [chapter]

Sanjam Garg, Craig Gentry, Shai Halevi, Mark Zhandry
2015 Lecture Notes in Computer Science  
As a separate technical contribution of independent interest, we show how to add to existing graded encoding schemes a new extension function, that can be thought of as dynamically introducing new encoding  ...  Previously known functional encryption (FE) schemes for general circuits relied on indistinguishability obfuscation, which in turn either relies on an exponential number of assumptions (basically, one  ...  We implement the extension functionality on the new graded encodings essentially the same way as for the basic scheme.  ... 
doi:10.1007/978-3-662-49099-0_18 fatcat:axvvtnq4dfaalmp6txlimt2v5u

Building Usable Witness Encryption [article]

Gavin Uberti, Kevin Luo, Oliver Cheng, Wittmann Goh
2021 arXiv   pre-print
In this paper, we build on an open-source multilinear map implementation by Carmer and Malozemoff of the graded encoding scheme CLT13 with asymmetric modifications.  ...  Finally, using a reduction from Sudoku to Exact Cover, we encrypted the private key to a Bitcoin wallet with 22,700 Satoshi using a Sudoku.  ...  • Extraction. ext(params, pzt , u) computes a random function of a ring element from their top-level encoding.  ... 
arXiv:2112.04581v1 fatcat:5czv244dfnfobpce42yygkvoum

An image compression and encryption scheme based on deep learning [article]

Fei Hu, Changjiu Pu, Haowei Gao, Mengzi Tang, Li Li
2016 arXiv   pre-print
Using chaotic logistic map, the compression ones can further be encrypted. In this study, an application of image compression and encryption is suggested using SAE and chaotic logistic map.  ...  It can be used for image transmission and image protection on internet simultaneously.  ...  Stacked Auto-encoder. 1) Feedforward processing is performed by computing the activation for each middle layer; 2) The grade error for the output layer is ( ) = −( − ( ) ) • ′ ( ( ) ) (1) 3) The grade  ... 
arXiv:1608.05001v2 fatcat:o2zsl6yztvejdo7vbdhhuwo32e

Indistinguishability Obfuscation from DDH-Like Assumptions on Constant-Degree Graded Encodings

Huijia Lin, Vinod Vaikuntanathan
2016 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)  
Our assumption on graded encodings is simple, has constant size, and does not require handling composite-order rings.  ...  We present a new construction of IO, with a security reduction based on two assumptions: (a) a DDH-like assumption -called the joint-SXDH assumption -on constant degree graded encodings, and (b) the existence  ...  FE from the joint-SXDH Assumption on Graded Encodings We finally describe our functional encryption scheme for NC 0 which is secure under the joint-SXDH assumption on tree-graded encodings.  ... 
doi:10.1109/focs.2016.11 dblp:conf/focs/LinV16 fatcat:4ht5vc7b55ehphb2vrc24xkneq

Graded Encoding Schemes from Obfuscation [chapter]

Pooya Farshim, Julia Hesse, Dennis Hofheinz, Enrique Larraia
2018 Lecture Notes in Computer Science  
We construct a graded encoding scheme (GES), an approximate form of graded multilinear maps.  ...  Thus, unlike previous GES constructions, there is no upper bound on the number of operations one can perform with our encodings. Hence, our GES essentially realizes what Garg et al.  ...  Game 3 : We hardwire the witness w y to y ∈ L lk in C Add and C Mult , and remove td ext from both circuits. We claim that this change does not change the functionality of C Add and C Mult at all.  ... 
doi:10.1007/978-3-319-76581-5_13 fatcat:bz4uctwmh5cb5lehkhvw7if63a

Indistinguishability Obfuscation from SXDH on 5-Linear Maps and Locality-5 PRGs [chapter]

Huijia Lin
2017 Lecture Notes in Computer Science  
When D = 2, this gives the SXDH assumption on bilinear pairing groups. Multilinear Maps v.s. Graded Encodings.  ...  done at encryption time.  ...  -5 graded encodings.  ... 
doi:10.1007/978-3-319-63688-7_20 fatcat:zyatiaqpqrfgffjt6xfff55twi

Witness Encryption from Instance Independent Assumptions [chapter]

Craig Gentry, Allison Lewko, Brent Waters
2014 Lecture Notes in Computer Science  
We show that this "isolation strategy" enables one to create a witness encryption system that is provably secure from assumptions that are (maximally) independent of any particular encryption instance.  ...  In addition to proposing the concept, their work provided a candidate for a witness encryption scheme built using multilinear encodings.  ...  The definition of "graded encoded system" and some of the procedures have been simplified or removed for our setting. We also add some procedures. Definition B.1 (Graded Encoding System).  ... 
doi:10.1007/978-3-662-44371-2_24 fatcat:ntwffm2bondvbo5xwhwjqnnooe

Steganography in Medical Images Using Advanced Reversible Data Hiding Scheme Based Encryption System

B Chitradevi
2020 Bioscience Biotechnology Research Communications  
Reversible data hidden in encrypted medical images fascinated care from data secrecy also security communities.  ...  Then the method identifies the minimum value from the first block and selects the number of blocks based on the power function.  ...  According to the result of a power function, some blocks will be chosen according to the length of a message to be encoded.  ... 
doi:10.21786/bbrc/13.13/41 fatcat:6qzpe2smq5c5pkfuolmgqprlia

Layered obfuscation: a taxonomy of software obfuscation techniques for layered security

Hui Xu, Yangfan Zhou, Jiang Ming, Michael Lyu
2020 Cybersecurity  
Our concept is based on the fact that real-world software is usually complicated. Merely applying one or several obfuscation approaches in an ad-hoc way cannot achieve good obscurity.  ...  In this way, it can assist developers in choosing obfuscation techniques and designing layered obfuscation solutions based on their specific requirements.  ...  encrypts MBPs with graded encoding mechanisms.  ... 
doi:10.1186/s42400-020-00049-3 fatcat:jrymozivkvbkbd3aeg3redj4ne

Batch Image Encryption Using Generated Deep Features Based on Stacked Autoencoder Network

Fei Hu, Jingyuan Wang, Xiaofei Xu, Changjiu Pu, Tao Peng
2017 Mathematical Problems in Engineering  
In this paper, we proposed a batch image encryption scheme into which a stacked autoencoder (SAE) network was introduced to generate two chaotic matrices; then one set is used to produce a total shuffling  ...  encrypted image.  ...  The encoding and decoding sections are combined to make the SAE network that has the functions of encoding and decoding.  ... 
doi:10.1155/2017/3675459 fatcat:jdoz6ef3cbhvxegu4p3wnhp4gi

A comparative study of combining deep learning and homomorphic encryption techniques

Emad Alsaedi, Alaa Kadhim
2022 Al-Qadisiyah Journal Of Pure Science  
Modern encryption schemes maintain personal secrecy and are the best method for protecting data stored on a server and data sent from an unauthorized third party.  ...  resource to process encrypted data without revealing sensitive information.  ...  Decryption relies on noise removal once rounding errors have been calculated.  ... 
doi:10.29350/qjps.2022.27.1.1452 fatcat:xg3updgwzfgbnpelqsvd4tagc4

Smart repeater system for communications interoperability during multiagency law enforcement operations

Richard I. Crutcher, R. W. Jones, Michael R. Moore, S. F. Smith, Alan L. Tolley, Robert W. Rochelle, Edward M. Carapezza, Donald Spector
1997 Command, Control, Communications, and Intelligence Systems for Law Enforcement  
The digital matrix layer provides the switching functions necessary for routing the digitized audio to and from radios operating in the encrypted mode.  ...  The smart repeater provides digital-level translation across encryption keys and those standards within the Motorola formats, thus removing one of the analog/digital/analog conversions and greatly improving  ... 
doi:10.1117/12.266741 fatcat:2ne6x6b7hrhm7fqsnvbeau2rdq

Candidate Multilinear Maps from Ideal Lattices [chapter]

Sanjam Garg, Craig Gentry, Shai Halevi
2013 Lecture Notes in Computer Science  
The security of our constructions relies on seemingly hard problems in ideal lattices, which can be viewed as extensions of the assumed hardness of the NTRU function.  ...  Goldwasser, Kalai, Popa, Vaikuntanathan, and Zeldovich [GKP + 13] show how one can use such an ABE scheme along with fully homomorphic encryption to construct a succinct single use functional encryption  ...  Obviously this function only depends on Σ = S T S and not on the particular choice of S.  ... 
doi:10.1007/978-3-642-38348-9_1 fatcat:y7kzpsg6rrh7nf33t6j2ajmosq

Faster CryptoNets: Leveraging Sparsity for Real-World Encrypted Inference [article]

Edward Chou, Josh Beal, Daniel Levy, Serena Yeung, Albert Haque, Li Fei-Fei
2018 arXiv   pre-print
We derive an optimal approximation for popular activation functions that achieves maximally-sparse encodings and minimizes approximation error.  ...  Homomorphic encryption enables arbitrary computation over data while it remains encrypted.  ...  We run encrypted inference on the 10,000 image MNIST test-set, and find no accuracy loss from our method's plaintext results (98.71%).  ... 
arXiv:1811.09953v1 fatcat:67vqy4vwqvahvd6kqcxuzp23ki
« Previous Showing results 1 — 15 out of 2,516 results