搜索结果: 1-15 共查到“密码学 Security proofs”相关记录23条 . 查询时间(0.109 秒)
Tighter security proofs for generic key encapsulation mechanism in the quantum random oracle model
quantum random oracle model key encapsulation mechanism generic construction
2019/2/27
In (TCC 2017), Hofheinz, Hoevelmanns and Kiltz provided a fine-grained and modular toolkit of generic key encapsulation mechanism (KEM) constructions, which were widely used among KEM submissions to N...
We present an improved version of the one-way to hiding (O2H) lemma by Unruh, J ACM 2015. Our new O2H lemma gives higher flexibility (arbitrary joint distributions of oracles and inputs, multiple repr...
Tighter Security Proofs for GPV-IBE in the Quantum Random Oracle Model
identity-based encryption quantum random oracle models LWE assumption
2018/5/22
In (STOC, 2008), Gentry, Peikert, and Vaikuntanathan proposed the first identity-based encryption (GPV-IBE) scheme based on a post-quantum assumption, namely, the learning with errors (LWE) assumption...
Equational Security Proofs of Oblivious Transfer Protocols
Equational security universal composability oblivious transfer
2016/6/20
We exemplify and evaluate the use of the equational framework of Micciancio and Tessaro (ITCS 2013) by analyzeing a number of concrete Oblivious Transfer protocols: a classic OT transformation to incr...
Security Proofs for Participation Privacy and Stronger Veri ability for Helios
voting participation privacy privacy
2016/5/3
The Helios voting scheme is well studied including formal
proofs for verifiability and ballot privacy, but it does not provide participation
privacy (i.e. it reveals who participated in the election...
Optimal Security Proofs for Signatures from Identification Schemes
Signatures Identification Schnorr tightness
2016/2/24
We perform a concrete security treatment of digital signature schemes obtained from canonical
identification schemes via the Fiat-Shamir transform. If the identification scheme is rerandomizable
and...
We present security proofs for the BLT signature scheme in the model, where hash functions
are built from ideal components (random oracles, ideal ciphers, etc.). We show that certain strengthening
o...
Making Masking Security Proofs Concrete Or How to Evaluate the Security of any Leaking Device
side-channel analysis masking security proofs
2016/1/4
We investigate the relationships between theoretical studies
of leaking cryptographic devices and concrete security evaluations
with standard side-channel attacks. Our contributions are in four part...
Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
public-key cryptography probability distributions
2015/12/30
The Rényi divergence is a measure of closeness of two probability
distributions. We show that it can often be used as an alternative
to the statistical distance in security proofs for lattice-based ...
Provable Security Proofs and their Interpretation in the Real World
Provable Security EDL Signature Scheme
2014/3/5
This paper analyses provable security proofs, using the EDL signature scheme as its case study, and interprets their bene fits and drawbacks when applied to the real world.
Provable security has been...
Modelling Time, or A Step Towards Reduction-based Security Proofs for OTP and Kerberos
BR model timestamp
2014/3/7
The notion of time plays an important role in many practically deployed cryptographic protocols, ranging from One-Time-Password (OTP) tokens to the Kerberos protocol. However, time is difficult to mod...
Automated Security Proofs for Almost-Universal Hash for MAC verification
block ciphers hash functions
2014/3/12
Message authentication codes (MACs) are an essential primitive in cryptography. They are used to ensure the integrity and authenticity of a message, and can also be used as a building block for larger...
Framework for Security Proofs for On-demand Routing Protocols in Multi-Hop Wireless Networks
cryptographic protocols
2012/3/28
We present a framework for security proofs for on-demand routing protocols. The framework relies on the composable cryptographic library by Backes, Pfitzmann and Waidner (BPW). The idea is to break do...
Remarks about the Security Proofs of Boneh-Franklin’s Identity-Based Encryption
Security Proofs Boneh-Franklin’s Identity-Based Encryption
2010/3/16
Boneh and Franklin constructed the first practical
Identity-Based Encryption (IBE) scheme in 2001. They also
defined a formal security model for IBE and proved their
scheme (BF-IBE) to be secure in...
Optimal security proofs for PSS and other signature schemes
Optimal security proofs PSS signature schemes
2009/4/16
Optimal security proofs for PSS and other signature schemes.