搜索结果: 1-15 共查到“知识库 军事学 Logarithmic”相关记录17条 . 查询时间(0.037 秒)
Ring Signatures: Logarithmic-Size, No Setup --- from Standard Assumptions
ring signatures linkable ring signatures standard model
2019/3/1
Ring signatures allow for creating signatures on behalf of an ad hoc group of signers, hiding the true identity of the signer among the group. A natural goal is to construct a ring signature scheme fo...
Sub-logarithmic Distributed Oblivious RAM with Small Block Size
Oblivious RAM Multi-Server Setting Secure Computation
2019/1/26
Oblivious RAM (ORAM) is a cryptographic primitive that allows a client to securely execute RAM programs over data that is stored in an untrusted server. Distributed Oblivious RAM is a variant of ORAM,...
Poly-Logarithmic Side Channel Rank Estimation via Exponential Sampling
Side Channel Rank Estimation Key Enumeration
2018/11/13
Rank estimation is an important tool for a side-channel evaluations laboratories. It allows estimating the remaining security after an attack has been performed, quantified as the time complexity and ...
Approximating Private Set Union/Intersection Cardinality with Logarithmic Complexity
Private Set Union Cardinality Private Set Intersection Cardinality Privacy Preserving Data Mining
2018/5/28
The computation of private set union/intersection cardinality (PSU-CA/PSI-CA) is one of the most intensively studied problems in Privacy Preserving Data Mining (PPDM). However, existing protocols are ...
PanORAMa: Oblivious RAM with Logarithmic Overhead
Oblivious RAM Oblivious Shuffle Oblivious Hash Table
2018/5/2
the input has a certain level of entropy. We combine these two primitives to improve the shuffle time in our hierarchical ORAM construction by avoiding heavy oblivious shuffles and leveraging entropy ...
The discrete logarithm problem over prime fields: the safe prime case. The Smart attack, non-canonical lifts and logarithmic derivatives
non-canonical lifts logarithmic derivatives
2017/3/6
The discrete logarithm problem over prime fields: the safe prime case. The Smart attack, non-canonical lifts and logarithmic derivatives.
Topology-Hiding Computation Beyond Logarithmic Diameter
topology hiding multi party computation broadcast voting
2017/2/20
A distributed computation in which nodes are connected by a partial communication graph is called \emph{topology-hiding} if it does not reveal information about the graph (beyond what is revealed by t...
Conversion from Arithmetic to Boolean Masking with Logarithmic Complexity
Side-channel attack first-order countermeasure arithmetic to Boolean conversion
2016/1/6
A general method to protect a cryptographic algorithm against side-channel attacks consists in masking all intermediate variables with a random value. For cryptographic algorithms combining Boolean op...
SOME REMARKS ON THE LOGARITHMIC SIGNATURES OF FINITE ABELIAN GROUPS
logarithmic signatures quasi-logarithmic signatures cyclic 2-group
2015/12/22
In the paper about the cryptosystem MST3, Svaba and Trung proposed
a way to build a cryptosystem based on the concept of logarithmic signatures,
and they choose Suzuki’s group, which is not abelian ...
Sometimes-Recurse Shuffle: Almost-Random Permutations in Logarithmic Expected Time
Card shuffling format-preserving encryption
2014/3/10
We describe a security-preserving construction of a random permutation of domain size N from a random function, the construction tolerating adversaries asking all N plaintexts, yet employing just \The...
Lattice-Based Group Signatures with Logarithmic Signature Size
group signatures lattice-based cryptography
2014/3/12
Group signatures are cryptographic primitives where users can anonymously sign messages in the name of a population they belong to. Gordon et al. (Asiacrypt 2010) suggested the first realization of gr...
Concurrent Zero-Knowledge in Poly-logarithmic Rounds
Concurrent Zero-Knowledge Poly-logarithmic Rounds
2009/4/17
A proof is concurrent zero-knowledge if it remains zero-knowledge when run in an
asynchronous environment, such as the Internet. It is known that zero-knowledge is
not necessarily preserved in such ...
Concurrent Zero Knowledge Proofs with Logarithmic Round-Complexity
Concurrent Zero Knowledge Proofs Logarithmic Round-Complexity
2009/4/14
We consider the problem of constructing Concurrent Zero Knowledge Proofs [6], in which the fascinating
and useful “zero knowledge” property is guaranteed even in situations where multiple concurrent
...
Single Database Private Information Retrieval with Logarithmic Communication
Single Database Private Information Retrieval Logarithmic Communication
2009/3/23
In this paper, we study the problem of single database private information retrieval, and
present schemes with only logarithmic server-side communication complexity. Previously the
best result could...
Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors
Lattices Admit Logarithmic Worst-Case Average-Case Connection Factors
2009/1/5
We demonstrate an average-case problem which is as hard as finding
(n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where
(n) = O(plog n).The previously best k...