428 Hits in 5.7 sec

FHE Circuit Privacy Almost for Free [chapter]

Florian Bourse, Rafaël Del Pino, Michele Minelli, Hoeteck Wee
2016 Lecture Notes in Computer Science  
Our analysis relies on a variant of the discrete Gaussian leftover hash lemma which states that e G −1 (v) + small noise does not depend on v. We believe that this result is of independent interest.  ...  Circuit privacy is an important property for many applications of fully homomorphic encryption.  ...  Acknowledgements We thank Vinod Vaikuntanathan for insightful discussions, as well as Damien Stehlé and the organizers of the HEAT summer school where this research started.  ... 
doi:10.1007/978-3-662-53008-5_3 fatcat:ndnbojbubzglncptuxhwdyivj4

DNA Based Cryptography Techniques with Applications and Limitations

2019 International Journal of Engineering and Advanced Technology  
This type's cryptography is a fresh and growing paradigm in the field of cryptography for secure communication on a different application.  ...  DNA cryptography is based on genetic information transfer from one generation to the next generation.  ...  At last, the encryption message arbitrarily hides in the second DNA sequence based on the numbers from GKF.  ... 
doi:10.35940/ijeat.f9285.088619 fatcat:etrqoc6nqbfwplioqnb7oenzby

Augmented Learning with Errors: The Untapped Potential of the Error Term [chapter]

Rachid El Bansarkhani, Özgür Dagdelen, Johannes Buchmann
2015 Lecture Notes in Computer Science  
To this end, we introduce a novel LWE-close assumption, namely Augmented Learning with Errors (A-LWE), which allows one to hide auxiliary data injected into the error term by a technique that we call message  ...  encryption scheme from A-LWE.  ...  The work presented in this paper was performed within the context of the Software Cluster project Sinnodium and Software Campus project IT-GiKo by Rachid El Bansarkhani.  ... 
doi:10.1007/978-3-662-47854-7_20 fatcat:tsyhrk6oxze7pfzdmdxmtl4q34

Revisiting and Evaluating Software Side-channel Vulnerabilities and Countermeasures in Cryptographic Applications [article]

Tianwei Zhang and Jun Jiang and Yinqian Zhang
2019 arXiv   pre-print
We systematize software side-channel attacks with a focus on vulnerabilities and countermeasures in the cryptographic implementations.  ...  We then evaluate popular libraries and applications, quantitatively measuring and comparing the vulnerability severity, response time and coverage.  ...  However, the calculation of MAC over a message M depends on the message length: it takes more time to compress longer M . Dummy MAC assumes the plaintext contains no padding, i.e., longest M .  ... 
arXiv:1911.09312v2 fatcat:o4am4aurlfajjkj7nuz3kbso6y

Trapdoors for hard lattices and new cryptographic constructions

Craig Gentry, Chris Peikert, Vinod Vaikuntanathan
2008 Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08  
deviation is essentially the length of the longest vector in the basis.  ...  A core technical component of our constructions is an efficient algorithm that, given a basis of an arbitrary lattice, samples lattice points from a Gaussian-like probability distribution whose standard  ...  + x as a "pad" to hide the message (where x ← χ).  ... 
doi:10.1145/1374376.1374407 dblp:conf/stoc/GentryPV08 fatcat:hm4bonilhjefxc5fx4xh7xlgai

Evaluating email's feasibility for botnet command and control

Kapil Singh, Abhinav Srivastava, Jonathon Giffin, Wenke Lee
2008 2008 IEEE International Conference on Dependable Systems and Networks With FTCS and DCC (DSN)  
In this case, improving the safety of email communication requires strategies designed to detect the presence of hidden commands, or to prevent bots from retrieving messages with those commands.  ...  Although it is more difficult for a botmaster to generate non-spam email than spam, we show with our second C&C design that hidden bot commands can be successfully distributed via non-spam messages.  ...  Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the NSF and the U.S. Army Research Office.  ... 
doi:10.1109/dsn.2008.4630106 dblp:conf/dsn/SinghSGL08 fatcat:xmmxuqqu2jc7fjoz3omcctnil4

Functional Encryption for Inner Product Predicates from Learning with Errors [chapter]

Shweta Agrawal, David Mandell Freeman, Vinod Vaikuntanathan
2011 Lecture Notes in Computer Science  
The main technique in our scheme is a novel twist to the identity-based encryption scheme of Agrawal, Boneh and Boyen (Eurocrypt 2010).  ...  We propose a lattice-based functional encryption scheme for inner product predicates whose security follows from the difficulty of the learning with errors (LWE) problem.  ...  The authors thank Dan Boneh, Brent Waters and Hoeteck Wee for helpful discussions.  ... 
doi:10.1007/978-3-642-25385-0_2 fatcat:4jjkctrgynb7rjdh7qwahev2gu

On the delay limited secrecy capacity of fading channels

Karim Khalil, Moustafa Youssef, O. Ozan Koyluoglu, Hesham El Gamal
2009 2009 IEEE International Symposium on Information Theory  
The first scenario assumes perfect prior knowledge of both the main and eavesdropper channel gains.  ...  Remarkably, under this assumption, we establish the achievability of non-zero secure rate (for a wide class of channel distributions) under a strict delay constraint.  ...  Here, the delay sensitive data of the current block is secured via Vernam's one time pad approach [6] , which was proved to achieve perfect secrecy by Shannon [7] , where the legitimate nodes agree on  ... 
doi:10.1109/isit.2009.5205955 dblp:conf/isit/KhalilYKG09 fatcat:dt7ktg5lizhfzijnmfnnnkck7a

Bicycle Attacks Considered Harmful: Quantifying the Damage of Widespread Password Length Leakage [article]

Benjamin Harsha, Robert Morton, Jeremiah Blocki, John Springer, Melissa Dark
2020 arXiv   pre-print
We examine the issue of password length leakage via encrypted traffic i.e., bicycle attacks.  ...  the length the encrypted packet containing the password.  ...  Padding. Similar to hashing, padding can help hide the length of the password. TLS (v1.2 and v1.3) and QUIC both support optional padding parameters.  ... 
arXiv:2002.01513v1 fatcat:qoqragkzezdx7c75apdthvwd2q

Classical Homomorphic Encryption for Quantum Circuits [article]

Urmila Mahadev
2018 arXiv   pre-print
We present the first leveled fully homomorphic encryption scheme for quantum circuits with classical keys.  ...  Finally, we show that a classical homomorphic encryption scheme with the required properties can be constructed from the learning with errors problem.  ...  This can be done via a classical homomorphic computation as long as the server is given the encryption of the trapdoor of the function pair f 0 , f 1 .  ... 
arXiv:1708.02130v4 fatcat:htpfdpxfyvbzdagrekady76kzy

Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages [chapter]

Zvika Brakerski, Vinod Vaikuntanathan
2011 Lecture Notes in Computer Science  
Specifically, he was able to reduce the security of his somewhat homomorphic encryption scheme to the worst-case hardness of standard problems (such as the shortest vector problem) on ideal lattices [15  ...  They also construct a very efficient ring counterpart to Regev's [34] public-key encryption scheme, as well as a counterpart to the identity based encryption scheme of [17] (using the basis sampling techniques  ...  We thank Chris Peikert for providing us with a full version of [26] , and Nigel Smart and the anonymous CRYPTO reviewers for numerous insightful comments on the draft.  ... 
doi:10.1007/978-3-642-22792-9_29 fatcat:gjzunbjw55h53fbe2dxkcqnm7y

Lockable Obfuscation

Rishab Goyal, Venkata Koppula, Brent Waters
2017 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)  
First, we show how to transform any attribute-based encryption (ABE) scheme into one in which the attributes used to encrypt the message are hidden from any user that is not authorized to decrypt the message  ...  One can evaluate the obfuscated program P on any input x where the output of evaluation is the message msg if P (x) = α and otherwise receives a rejecting symbol ⊥.  ...  However, there is nothing in the definition of witness encryption that guarantees the hiding of the description of the circuit C itself.  ... 
doi:10.1109/focs.2017.62 dblp:conf/focs/GoyalKW17 fatcat:vbaadqt3ofarpaynqwxhot5voe

Leakage Perturbation is Not Enough: Breaking Structured Encryption Using Simulated Annealing [article]

Zichen Gui, Kenneth G. Paterson, Sikhar Patranabis
2021 IACR Cryptology ePrint Archive  
In particular, our attack works even when the SSE schemes are built in the natural way using the state-of-the-art techniques (namely, volume-hiding encrypted multi-maps) designed to suppress leakage and  ...  The vast majority of the literature on SSE considers only leakage from one component of the overall SSE system, the encrypted search index.  ...  The first term of the likelihood decomposition for differentially private volume-hiding EMMs [PPYY19] is similar to that of the full padding version, except that the query response lengths are padded  ... 
dblp:journals/iacr/GuiPP21 fatcat:yiicpik7irdqbd7z5vey325fte

A video coverless information hiding algorithm based on semantic segmentation

Nan Pan, Jiaohua Qin, Yun Tan, Xuyu Xiang, Guimin Hou
2020 EURASIP Journal on Image and Video Processing  
Due to the fact that coverless information hiding can effectively resist the detection of steganalysis tools, it has attracted more attention in the field of information hiding.  ...  To quickly index the sender's secret message to the corresponding video frame, we build a three-digit index structure.  ...  Availability of data and materials Please contact author for data requests.  ... 
doi:10.1186/s13640-020-00512-8 fatcat:5c4bj5tf4jdttixls7k5rmgjzu

Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys

Benny Applebaum, Yuval Ishai, Eyal Kushilevitz, Brent Waters
2015 SIAM journal on computing (Print)  
Yao's garbled circuit construction gives rise to such randomized encodings in which the online partx consists of n encryption keys of length κ each, where n = |x| and κ is a security parameter.  ...  More concretely, the online part x consists of an n-bit string and a single encryption key.  ...  The first author was supported by Alon Fellowship, ISF grant 1155/11, Israel Ministry of Science and Technology (grant 3-  ... 
doi:10.1137/130929643 fatcat:pwv2vdym4jeptaawxgca2pygxe
« Previous Showing results 1 — 15 out of 428 results