搜索结果: 1-15 共查到“军事学 structure”相关记录66条 . 查询时间(0.162 秒)
Efficient Tightly-Secure Structure-Preserving Signatures and Unbounded Simulation-Sound QA-NIZK Proofs
Structure-preserving signatures QA-NIZK simulation-soundness
2019/9/16
We show how to construct structure-preserving signatures (SPS) and unbounded quasi-adaptive non-interactive zero-knowledge (USS QA-NIZK) proofs with a tight security reduction to simple assumptions, b...
Succinct Arguments for Bilinear Group Arithmetic: Practical Structure-Preserving Cryptography
NIZK short proofs
2019/8/30
In their celebrated work, Groth and Sahai [EUROCRYPT'08, SICOMP' 12] constructed non-interactive zero-knowledge (NIZK) proofs for general bilinear group arithmetic relations, which spawned the entire ...
Structure-Preserving and Re-randomizable RCCA-secure Public Key Encryption and its Applications
public-key cryptography Rand-RCCA PKE
2019/8/22
Re-randomizable RCCA-secure public key encryption (Rand-RCCA PKE) schemes reconcile the property of re-randomizability of the ciphertexts with the need of security against chosen-ciphertexts attacks.
A Candidate Access Structure for Super-polynomial Lower Bound on Information Ratio
secret sharing general access structures information ratio
2019/6/3
The contribution vector (convec) of a secret sharing scheme is the vector of all share sizes divided by the secret size. A measure on the convec (e.g., its maximum or average) is considered as a crite...
Further Lower Bounds for Structure-Preserving Signatures in Asymmetric Bilinear Groups
public-key cryptography Structure-Preserving Signatures
2019/1/2
Structure-Preserving Signatures (SPSs) are a useful tool for the design of modular cryptographic protocols. Recent series of works have shown that by limiting the message space of those schemes to the...
Lower Bounds on Structure-Preserving Signatures for Bilateral Messages
Structure-Preserving Signatures Bilateral Messages Crucial Relation
2018/7/9
Lower bounds for structure-preserving signature (SPS) schemes based on non-interactive assumptions have only been established in the case of unilateral messages, i.e. schemes signing tuples of group e...
Paralysis Proofs: Safe Access-Structure Updates for Cryptocurrencies and More
blockchain, access structure, trusted hardware
2018/1/29
Suppose that NN players share cryptocurrency using an M-of-N multisig scheme. If N-M+1 players disappear, the remaining ones have a problem: They’ve permanently lost their funds. We introduce Paralysi...
More Efficient (Almost) Tightly Secure Structure-Preserving Signatures
Structure-preserving signatures tight security
2018/1/17
We provide a structure-preserving signature (SPS) scheme with an (almost) tight security reduction to a standard assumption. Compared to the state-of-the-art tightly secure SPS scheme of Abe et al.
Improved (Almost) Tightly-Secure Structure-Preserving Signatures
Structure preserving signatures bilinear pairings SXDH
2018/1/11
Structure Preserving Signatures (SPS) allow the signatures and the messages signed to be further encrypted while retaining the ability to be proven valid under zero-knowledge. In particular, SPS are t...
How Low Can You Go? Short Structure-Preserving Signatures for Diffie-Hellman Vectors
Digital Signatures Structure-Preserving Signatures Type-3 Groups
2017/9/25
Structure-Preserving Signatures (SPSs) are an important tool for the design of modular cryptographic protocols. It has been proven that such schemes in the most efficient Type-3 bilinear group setting...
Compact Structure-preserving Signatures with Almost Tight Security
Structure-preserving signatures Tight reduction Adaptive partitioning
2017/6/6
In structure-preserving cryptography, every building block shares the same bilinear groups. These groups must be generated for a specific, a prior fixed security level, and thus it is vital that the s...
Looking more closely, our characterization applies only to a very wide class of ff, and only for protocols that are deterministic or logarithmic-round. However, we give concrete examples showing that ...
Improved Structure Preserving Signatures under Standard Bilinear Assumptions
QA-NIZK SXDH MDDH
2017/2/20
We show that the recent structure-preserving signature (SPS) scheme of Kiltz, Pan and Wee [CRYPTO 2015], provably secure under the standard bilinear pairings group assumption SXDH, can be improved to ...
How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones
signature trapdoor signature fully structure-preserving
2016/12/9
In this paper, we bridge the gap between structure-preserving signatures (SPSs) and fully structure-preserving signatures (FSPSs). In SPSs, all the messages, signatures, and verification keys consist ...
The complexity of the connected graph access structure on seven participants
Access structure Complexity Secret sharing scheme
2016/12/8
In this paper, we study an important problem in secret sharing that
determines the exact value or bound for the complexity. First, we used induced
subgraph complexity of the graph G with access stru...