Sciweavers

608 search results - page 41 / 122
» Interactive Oracle Proofs
Sort
View
PKC
2004
Springer
112views Cryptology» more  PKC 2004»
14 years 3 months ago
Identity-Based Threshold Decryption
Abstract. In this paper, we examine issues related to the construction of identity-based threshold decryption schemes and argue that it is important in practice to design an identi...
Joonsang Baek, Yuliang Zheng
ACNS
2010
Springer
159views Cryptology» more  ACNS 2010»
14 years 2 months ago
A Message Recognition Protocol Based on Standard Assumptions
We look at the problem of designing Message Recognition Protocols (MRP) and note that all proposals available in the literature have relied on security proofs which hold in the ran...
Atefeh Mashatan, Serge Vaudenay
CRYPTO
2000
Springer
139views Cryptology» more  CRYPTO 2000»
14 years 2 months ago
On the Exact Security of Full Domain Hash
Abstract. The Full Domain Hash (FDH) scheme is a RSA-based signature scheme in which the message is hashed onto the full domain of the RSA function. The FDH scheme is provably secu...
Jean-Sébastien Coron
LFCS
1994
Springer
14 years 2 months ago
Strong Normalization in a Non-Deterministic Typed Lambda-Calculus
In a previous paper [4], we introduced a non-deterministic -calculus (-LK) whose type system corresponds exactly to Gentzen's cut-free LK [9]. This calculus, however, cannot b...
Philippe de Groote
ACISP
2008
Springer
13 years 11 months ago
Efficient One-Round Key Exchange in the Standard Model
We consider one-round key exchange protocols secure in the standard model. The security analysis uses the powerful security model of Canetti and Krawczyk and a natural extension of...
Colin Boyd, Yvonne Cliff, Juan Manuel Gonzá...