搜索结果: 1-15 共查到“军队指挥学 adaptively secure”相关记录46条 . 查询时间(0.087 秒)
Compact Adaptively Secure ABE for NC1 from k-Lin
attribute-based encryption adaptive security bilinear maps
2019/2/28
We present compact attribute-based encryption (ABE) schemes for NC1 that are adaptively secure under the k-Lin assumption with polynomial security loss. Our KP-ABE scheme achieves ciphertext size that...
Adaptively Secure MPC with Sublinear Communication Complexity
secure multiparty computation adaptive security sublinear communication
2018/12/3
A central challenge in the study of MPC is to balance between security guarantees, hardness assumptions, and resources required for the protocol. In this work, we study the cost of tolerating adaptive...
In distributed pseudorandom functions (DPRFs), a PRF secret key SKSK is secret shared among NN servers so that each server can locally compute a partial evaluation of the PRF on some input XX. A combi...
Adaptively Secure and Succinct Functional Encryption: Improving Security and Efficiency, Simultaneously
Functional encryption Adaptive security Succinctness
2018/11/6
Functional encryption (FE) is advanced encryption that enables us to issue functional decryption keys where functions are hardwired. When we decrypt a ciphertext of a message mm by a functional decryp...
All existing security proofs for PRE only show selective security, where the adversary must first declare the users it wants to corrupt. This can be lifted to more meaningful adaptive security by gues...
Tight Adaptively Secure Broadcast Encryption with Short Ciphertexts and Keys
broadcast encryption bilinear group
2018/5/2
We present a new public key broadcast encryption scheme where both the ciphertext and secret keys consist of a constant number of group elements. Our result improves upon the work of Boneh, Gentry, an...
Adaptively Secure Garbling with Near Optimal Online Complexity
Errors assumption standard model
2018/3/7
We construct an adaptively secure garbling scheme with an online communication complexity of n+m+poly(log|C|,sec)n+m+poly(log|C|,sec) where C:{0,1}n→{0,1}mC:{0,1}n→{0,1}m is the circuit being g...
Efficient Adaptively Secure Zero-knowledge from Garbled Circuits
Zero-knowledge Garbled Circuits Adaptive Security
2018/1/11
Zero-knowledge (ZK) protocols are undoubtedly among the central primitives in cryptography, lending their power to numerous applications such as secure computation, voting, auctions, and anonymous cre...
A Framework for Efficient Adaptively Secure Composable Oblivious Transfer in the ROM
cryptographic protocols Oblivious Transfer
2017/10/12
Oblivious Transfer (OT) is a fundamental cryptographic protocol that finds a number of applications, in particular, as an essential building block for two-party and multi-party computation. We constru...
Fast and Adaptively Secure Signatures in the Random Oracle Model from Indistinguishability Obfuscation
Signature scheme indistinguishability obfuscation puncturable pseudo-random functions
2017/10/9
Indistinguishability obfuscation (iO) is a powerful cryptographic tool often employed to construct a variety of core cryptographic primitives such as public key encryption and signatures. In this pape...
Ouroboros Praos: An adaptively-secure, semi-synchronous proof-of-stake protocol
blockchain consensus proof of stake
2017/6/15
We present “Ouroboros Praos”, a new proof-of-stake blockchain protocol that provides, for the first time, a robust distributed ledger that is provably secure in the semi-synchronous adversarial settin...
Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model
Secure Computation Tamper-Proof Hardware Adaptive Security
2017/2/20
Achieving constant-round adaptively secure protocols (where all parties can be corrupted) in the plain model is a notoriously hard problem. Very recently, three works published in TCC 2015 (Dachman-So...
Adaptively Secure Recipient Revocable Broadcast Encryption with Constant size Ciphertext
recipient revocable broadcast encryption chosen plaintext attack adaptive security
2017/2/20
In this paper, we put forward the first adaptively secure recipient revocable broadcast encryption (RR-BE) scheme in the standard model. The scheme is adaptively secure against chosen plaintext attack...
Asymptotically Compact Adaptively Secure Lattice IBEs and Verifiable Random Functions via Generalized Partitioning Techniques
identity-based encryption verifiable random function adaptive security
2017/2/20
In this paper, we focus on the constructions of adaptively secure identity-based encryption (IBE) from lattices and verifiable random function (VRF) with large input spaces. Existing constructions of ...
Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model
adaptive security Yao garbled circuits secure computation
2017/1/3
Yao's garbling scheme is one of the basic building blocks of cryptographic protocol design. Originally designed to enable two-message, two-party secure computation, the scheme has been extended in man...