搜索结果: 1-15 共查到“军队指挥学 standard model”相关记录69条 . 查询时间(0.125 秒)
Post-Quantum UC-Secure Oblivious Transfer in the Standard Model with Adaptive Corruptions
Smooth Projective Hash Functions Oblivious Transfer
2019/6/19
Since the seminal result of Kilian, Oblivious Transfer has proven to be a fundamental primitive in cryptography. In such a scheme, a user is able to gain access to an element owned by a server, withou...
Group Signatures without NIZK: From Lattices in the Standard Model
Group signatures Lattices Attribute-based signatures
2019/2/28
In a group signature scheme, users can anonymously sign messages on behalf of the group they belong to, yet it is possible to trace the signer when needed. Since the first proposal of lattice-based gr...
Improved Lattice-based CCA2-Secure PKE in the Standard Model
public-key encryption learning with errors chosen ciphertext security
2019/2/25
Based on the identity-based encryption (IBE) from lattices by Agrawal et al. (Eurocrypt'10), Micciancio and Peikert (Eurocrypt'12) presented a CCA1-secure public-key encryption (PKE), which has the be...
Group signature is a central tool for privacy-preserving protocols, ensuring authentication, anonymity and accountability. It has been massively used in cryptography, either directly or through varian...
A Universal Designated Verifier Signature Scheme with Non-Delegatability in the Standard Model
Designated Verifier Signature Universal Designated Verifier Signature Non-Delegatability
2017/9/1
In a designated verifier signature (DVS) scheme a signer creates a signature which is only verifiable by a designated verifier. A DVS is a useful scheme for authenticating a signer without disturbing ...
Multi-Designated Verifiers Signature Schemes with Threshold Verifiability: Generic Pattern and a Concrete Scheme in the Standard Model
Digital Signature Designated Verifier Signature Scheme Multi-Designated Verifiers Signature Scheme
2017/8/28
In a designated verifier signature (DVS) scheme, the validity of the signature can only be verified by a designated entity chosen by the signer. Furthermore, the designated entity cannot convince a th...
Efficient Round-Optimal Blind Signatures in the Standard Model
Blind Signatures Round-Optimal Partial Blindness
2017/2/20
Blind signatures are at the core of e-cash systems and has numerous other applications. In this work we construct efficient blind and partially blind signature schemes over bilinear groups in the stan...
Public Key Encryption with Equality Test in the Standard Model
Public key encryption with equality test identity-based encryption with equality test standard model
2017/1/3
Public key encryption with equality test (PKEET) is a cryptosystem that allows a tester who has trapdoors issued by one or more users UiUi to perform equality tests on ciphertexts encrypted using publ...
An Attribute-Based Anonymous Broadcast Encryption Scheme with Adaptive Security in the Standard Model
Broadcast Encryption Ciphertext-Policy Attribute-Based Encryption (CP-ABE) Access Structure
2016/12/7
In broadcast encryption schemes, a distribution center broadcasts an encrypted message to a subset SS chosen from a universe of receivers and only the intended users are able to decrypt the message. M...
Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
Blind Signatures Standard Model SPS-EQ
2016/6/29
At Crypto’15 Fuchsbauer, Hanser and Slamanig (FHS) presented the first standardmodel
construction of efficient round-optimal blind signatures that does not require complexity
leveraging. It is conce...
Fair mPSI and mPSI-CA: Efficient Constructions in Prime Order Groups with Security in the Standard Model against Malicious Adversary
mPSI mPSI-CA malicious adversary
2016/3/1
In this paper, we propose a construction of fair and efficient mutual Private Set Intersection (mPSI) with linear communication and computation complexities, where the underlying group is of prime ord...
Generic Transformation of a CCA2-Secure Public-Key Encryption Scheme to an eCK-Secure Key Exchange Protocol in the Standard Model
Department of Computer Engineering,University of Peradeniya
2016/1/26
LaMacchia, Lauter and Mityagin presented a strong security model for authenticated key agreement, namely the eCK model. They also constructed a protocol, namely the NAXOS protocol, that enjoys a simpl...
We present a signature scheme provably secure in the standard model (no random oracles) based on the
worst-case complexity of approximating the Shortest Vector Problem in ideal lattices within polyno...
Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model
puncturable pseudorandom functions adaptive security
2016/1/8
We study the adaptive security of constrained PRFs in the standard model. We initiate our exploration with puncturable PRFs. A puncturable PRF family is a special class of constrained PRFs, where the ...
Resisting Randomness Subversion: Fast Deterministic and Hedged Public-key Encryption in the Standard Model
Hedged encryption randomness subversion
2016/1/6
This paper provides the first efficient, standard-model, fully-secure schemes for some related and
challenging forms of public-key encryption (PKE), namely deterministic and hedged PKE. These forms
...