搜索结果: 1-15 共查到“知识库 军事学 depth”相关记录17条 . 查询时间(0.031 秒)
Faster homomorphic encryption is not enough: improved heuristic for multiplicative depth minimization of Boolean circuits
somewhat homomorphic encryption multiplicative depth Boolean functions
font style='font-size:12px;'>
2019/8/27
In somewhat homomorphic encryption schemes (e.g. B/FV, BGV) the size of ciphertexts and the execution performance of homomorphic operations depends heavily on the multiplicative depth. The multiplicat...
Non-Malleable Codes for Small-Depth Circuits
non-malleable codes small-depth circuit switching lemma
font style='font-size:12px;'>
2018/3/5
We obtain our codes via a new efficient non-malleable reduction from small-depth tampering to split-state tampering. A novel aspect of our work is the incorporation of techniques from unconditional de...
Towards an in-depth understanding of privacy parameters for randomized sanitization mechanisms
Anonymity Differential Privacy
font style='font-size:12px;'>
2017/9/18
Differential privacy, and close other notions such as dχdχ-privacy, is at the heart of the privacy framework when considering the use of randomization to ensure data privacy. Such a guarantee is alway...
On the Depth of Oblivious Parallel RAM
OPRAM PRAM
font style='font-size:12px;'>
2017/9/13
Oblivious Parallel RAM (OPRAM), first proposed by Boyle, Chung, and Pass, is the natural parallel extension of Oblivious RAM (ORAM). OPRAM provides a powerful cryptographic building block for hiding t...
On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i
Argon2i Memory Hard Functions Depth-Robustness
font style='font-size:12px;'>
2017/5/25
Argon2i is a data-independent memory hard function that won the password hashing competition. The password hashing algorithm has already been incorporated into several open source crypto libraries suc...
Software Implementation of 2-Depth Pairing-based Homomorphic Encryption Scheme
homomorphic encryption pairing-based cryptography
font style='font-size:12px;'>
2017/2/20
We propose a software implementation of a variant of Boneh-Goh-Nissim scheme \cite{BGN05} with multiplicative depth 22, {whereas the original one only tackled multiplicative depth 11}. We employ toget...
Depth-Robust Graphs and Their Cumulative Memory Complexity
Memory-Hard Functions Depth-Robust Graphs
font style='font-size:12px;'>
2016/12/9
There is growing interest in the security community in functions which are moderately hard to compute on a normal single-processor machine, but which cannot be computed at a significantly lower cost o...
Non-Malleable Codes for Bounded Depth, Bounded Fan-in Circuits
non-malleable code bounded output locality bounded-depth circuit
font style='font-size:12px;'>
2016/3/21
We show how to construct efficient, unconditionally secure non-malleable codes for bounded output locality. In particular, our scheme is resilient against functions such that any output bit is depende...
Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN
Symmetric Cryptography Low-depth PRFs Learning Parity with Noise
font style='font-size:12px;'>
2016/2/23
Pseudorandom functions (PRFs) play a central role in symmetric cryptography. While in principle
they can be built from any one-way functions by going through the generic HILL (SICOMP
1999) and GGM (...
Homomorphic evaluation requires depth
complexity of cryptography homomorphic encryption
font style='font-size:12px;'>
2015/12/22
We show that homomorphic evaluation of any non-trivial
functionality of sufficiently many inputs with respect to any CPA secure
homomorphic encryption scheme cannot be implemented by circuits of
po...
Efficient Multiparty Protocols via Log-Depth Threshold Formulae
Multiparty computation MPC
font style='font-size:12px;'>
2014/3/11
We put forward a new approach for the design of efficient multiparty protocols:
1. Design a protocol for a small number of parties (say, 3 or 4) which achieves security against a single corrupted par...
Attribute-Based Encryption for a Subclass of Circuits with Bounded Depth from Lattices
Functional Encryption Attribute-Based Encryption
font style='font-size:12px;'>
2014/3/12
In this work, we present two Key-Policy Attribute-Based Encryption (ABE) schemes for some subclass of circuits based on the Learning with Error (LWE) assumption. Our constructions are selectively secu...
Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
foundations / Fully-homomorphic encryption
font style='font-size:12px;'>
2012/3/28
We describe a new approach for constructing fully homomorphic encryption (FHE) schemes. Previous FHE schemes all use the same blueprint from [Gentry 2009]: First construct a somewhat homomorphic encry...
A depth-16 circuit for the AES S-box
AES S-box nite eld inversion circuit complexity circuit depth.
font style='font-size:12px;'>
2011/7/25
New techniques for reducing the depth of circuits for cryptographic applications are described and applied to the AES S-box.
A depth-16 circuit for the AES S-box
implementation / AES S-box nite eld inversion circuit complexity circuit depth
font style='font-size:12px;'>
2012/3/27
New techniques for reducing the depth of circuits for cryptographic applications are described and applied to the AES S-box. These techniques also keep the number of gates quite small. The result, whe...