搜索结果: 1-15 共查到“密码学 Standard”相关记录173条 . 查询时间(0.225 秒)
Separating Standard and Asymmetric Password-Authenticated Key Exchange
PAKE Password-Authenticated Key Exchange
2019/9/23
Password-Authenticated Key Exchange (PAKE) is a method to establish cryptographic keys between two users sharing a low-entropy password. In its asymmetric version, one of the users acts as a server an...
Collusion Resistant Trace-and-Revoke for Arbitrary Identities from Standard Assumptions
public-key cryptography traitor tracing, revocation
2019/8/30
A traitor tracing scheme is a multi-user public-key encryption scheme where each user in the system holds a decryption key that is associated with the user's identity. Using the public key, a content ...
Homomorphic Encryption is a breakthrough technology which can enable private cloud storage and computation solutions, and many applications have been described in the literature in the last few years....
Non-zero Inner Product Encryptions: Strong Security under Standard Assumptions
non-zero inner product encryptions adaptive security payload- hiding
2019/7/15
Non-zero inner product encryption (NIPE) allows a user to encrypt a message with its attribute vector and decryption is possible using a secret-key associated with a predicate vector if the inner prod...
Efficient Lattice-Based Zero-Knowledge Arguments with Standard Soundness: Construction and Applications
Lattice Zero-Knowledge Argument
2019/6/26
We provide new zero-knowledge argument of knowledge systems that work directly for a wide class of language, namely, ones involving the satisfiability of matrix-vector relations and integer relations ...
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...
Broadcast and Trace with N^epsilon Ciphertext Size from Standard Assumptions
public-key cryptography Standard Assumptions
2019/6/4
We construct a broadcast and trace scheme (also known as trace and revoke or broadcast, trace and revoke) with NN users, where the ciphertext size can be made as low as O(Nϵ)O(Nϵ), for any...
Fast Keyed-Verification Anonymous Credentials on Standard Smart Cards
Privacy anonymous credentials authentication
2019/5/13
Cryptographic anonymous credential schemes allow users to prove their personal attributes, such as age, nationality, or the validity of a ticket or a pre-paid pass, while preserving their privacy, as ...
Lelantus: Towards Confidentiality and Anonymity of Blockchain Transactions from Standard Assumptions
Zero-knowledge Proofs Confidential Transactions Zcoin
2019/4/15
We propose Lelantus, a new anonymous payment system which ensures both transaction confidentiality and anonymity with small proof sizes, short verification times and without requiring a trusted setup.
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...
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...
Hunting and Gathering - Verifiable Random Functions from Standard Assumptions with Short Proofs
public-key cryptography verifiable random functions
2019/1/18
A verifiable random function (VRF) is a pseudorandom function, where outputs can be publicly verified. That is, given an output value together with a proof, one can check that the function was indeed ...
Memory-Constrained Implementation of Lattice-based Encryption Scheme on the Standard Java Card Platform
Post-Quantum Cryptography Lattice-based Encryption Scheme Java Card
2019/1/2
Memory-constrained devices, including widely used smart cards, require resisting attacks by the quantum computers. Lattice-based encryption scheme possesses high efficiency and reliability which could...
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...