搜索结果: 1-15 共查到“军事学 Secrets”相关记录37条 . 查询时间(0.062 秒)
Securely managing encrypted data on an untrusted party is a challenging problem that has motivated the study of a variety of cryptographic primitives. A special class of such primitives allows an untr...
Secret-Sharing from Robust Conditional Disclosure of Secrets
cryptographic protocols secret sharing
2019/5/21
A secret-sharing scheme is a method by which a dealer, holding a secret string, distributes shares to parties such that only authorized subsets of parties can reconstruct the secret. The collection of...
A time-release protocol enables one to send secrets into a future release time. The main technical challenge lies in incorporating timing control into the protocol, especially in the absence of a cent...
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe
information theoretic cryptography communication complexity
2018/12/3
In the Conditional Disclosure of Secrets (CDS) problem (Gertner et al., J. Comput. Syst. Sci., 2000) Alice and Bob, who hold nn-bit inputs xx and yy respectively, wish to release a common secret zz to...
On the Hardness of Learning With Errors with Binary Secrets
complexity theory lattice based cryptography foundations
2018/11/5
We give a simple proof that the decisional Learning With Errors (LWE) problem with binary secrets (and an arbitrary polynomial number of samples) is at least as hard as the standard LWE problem (with ...
Recovering Secrets From Prefix-Dependent Leakage
Galton--Watson process discrete logarithm problem cryptanalysis
2018/9/6
We discuss how to recover a secret bitstring given partial information obtained during a computation over that string, assuming the computation is a deterministic algorithm processing the secret bits ...
Isogeny Secrets can be Traded
isogeny secret exchange
2018/8/21
We consider a situation in which two mutually distrusting parties, each possessing a secret piece of information, wish to exchange these secrets while communicating over a secure channel, in effect ``...
The Ring Learning with Errors problem (RLWE) introduced by Lyubashevsky, Peikert and Regev (LPR, Eurocrypt 2010, Eurocrypt 2013) quickly became a central element in cryptographic literature and a foun...
Optimal Linear Multiparty Conditional Disclosure of Secrets Protocols
Secret-sharing schemes conditional disclosure of secrets protocols
2018/5/15
In a kk-party CDS protocol, each party sends one message to a referee (without seeing the other messages) such that the referee will learn a secret held by the parties if and only if the inputs of the...
Hidden in Plain Sight: Storing and Managing Secrets on a Public Ledger
blockchain decentralisation access control
2018/3/5
Current blockchain systems are incapable of holding sensitive data securely on their public ledger while supporting accountability of data access requests and revocability of data access rights. Inste...
White-box cryptography protects key extraction from software implementations of cryptographic primitives. It is widely deployed in DRM and mobile payment applications in which a malicious attacker mig...
Conditional Disclosure of Secrets and d-Uniform Secret Sharing with Constant Information Rate
secret sharing information-theoretic cryptography
2018/1/12
Our main result applies to exponentially long secrets, and so it should be mainly viewed as a barrier against amortizable lower-bound techniques. We also show that in some natural simple cases (e.g., ...
Performing Computations on Hierarchically Shared Secrets
hierarchical secret sharing Birkhoff interpolation verifiable secret sharing
2017/10/30
Hierarchical secret sharing schemes distribute a message to a set of shareholders with different reconstruction capabilities. In distributed storage systems, this is an important property because it a...
New Protocols for Conditional Disclosure of Secrets (and More)
secret sharing information theoretic
2017/4/27
We present new protocols for conditional disclosure of secrets (CDS), where two parties want to disclose a secret to a third party if and only if their respective inputs satisfy some predicate.
Amortization with Fewer Equations for Proving Knowledge of Small Secrets
zero knowledge protocols proofs of knowledge
2017/3/31
For a linear function ff, a vector xx with small coefficients, and a vector y=f(x)y=f(x), we would like to be able to give a zero-knowledge proof for the knowledge of an x′x′ with small coefficients t...