Filters








18 Hits in 3.0 sec

New Techniques for SPHFs and Efficient One-Round PAKE Protocols [chapter]

Fabrice Benhamouda, Olivier Blazy, Céline Chevalier, David Pointcheval, Damien Vergnaud
2013 Lecture Notes in Computer Science  
Following the Gennaro and Lindell's approach, with a new kind of smooth-projective hash functions (SPHFs), Katz and Vaikuntanathan recently came up with the first concrete one-round PAKE protocols, where  ...  (one for the BPR-secure protocol and two for the UC-secure one), which make the overall constructions not really efficient.  ...  We would like to thank Jonathan Katz for his helpful comments and anonymous referees of Crypto 2013 for their valuable inputs. This work was supported in part by the French ANR-  ... 
doi:10.1007/978-3-642-40041-4_25 fatcat:nj2nvocbxrhhpl7gpijhc6ezmy

Password-Based Authenticated Key Exchange without Centralized Trusted Setup [chapter]

Kazuki Yoneyama
2014 Lecture Notes in Computer Science  
In this paper, we discuss how to relax the setup assumption for (constant round) PAKE schemes.  ...  There are a few secure PAKE schemes in the plain model, but, these are not achievable in a constant round (i.e., containing a linear number of rounds).  ...  We introduce a new round-efficient PAKE scheme in the MS model. Our scheme has two attractive points beside existing schemes as follows: 1. Round-Efficiency.  ... 
doi:10.1007/978-3-319-07536-5_2 fatcat:ijv57zywwvcjrnawdhxmteshie

SPHF-Friendly Non-interactive Commitments [chapter]

Michel Abdalla, Fabrice Benhamouda, Olivier Blazy, Céline Chevalier, David Pointcheval
2013 Lecture Notes in Computer Science  
Furthermore, the new PAKE instantiation is the first one-round scheme achieving UC security against adaptive adversaries.  ...  Our instantiations are more efficient than the Abdalla et al. PAKE in Crypto 2009 and the recent OT protocol proposed by Choi et al. in PKC 2013.  ...  We thank Ralf Küsters for his comments on a preliminary version. This work was supported in part by the  ... 
doi:10.1007/978-3-642-42033-7_12 fatcat:a2scpy4eurablhpu4mzk567mlm

Removing Erasures with Explainable Hash Proof Systems [chapter]

Michel Abdalla, Fabrice Benhamouda, David Pointcheval
2017 Lecture Notes in Computer Science  
As an important side contribution, we also propose a new commitment scheme based on DDH, which leads to the construction of the first one-round PAKE adaptively secure under plain DDH without pairing, assuming  ...  Next, we demonstrate that this new tool generically leads to efficient PAKE and OT protocols that are secure against semi-adaptive adversaries without erasures in the Universal Composability (UC) framework  ...  Acknowledgments This work was supported in part by the French ANR-12-INSE-0014 SIMPATIC Project, the CFM Foundation, and the European Research Council under the European Community's Seventh Framework Programme  ... 
doi:10.1007/978-3-662-54365-8_7 fatcat:qak4wib37nd4zlqonf42drbofa

Universally Composable Two-Server PAKE [chapter]

Franziskus Kiefer, Mark Manulis
2016 Lecture Notes in Computer Science  
As one of the building blocks we define and construct a new cryptographic primitive, called Trapdoor Distributed Smooth Projective Hash Function (TD-SPHF), which could be of independent interest.  ...  Two-Server Password Authenticated Key Exchange (2PAKE) protocols apply secret sharing techniques to achieve protection against server-compromise attacks. 2PAKE protocols eliminate the need for password  ...  The proposed 2PAKE protocol uses a common reference string and the SXDH assumption on bilinear groups and is efficient thanks to the simulatability of TD-SPHF.  ... 
doi:10.1007/978-3-319-45871-7_10 fatcat:rjvpi6w7qbdh7kayj5ozfrt3e4

Structure-Preserving Smooth Projective Hashing [chapter]

Olivier Blazy, Céline Chevalier
2016 Lecture Notes in Computer Science  
In this work, we introduce and instantiate the concept of Structure-Preserving Smooth Projective Hash Function, and give as applications more efficient instantiations for one-round PAKE and three-round  ...  Classical constructions of Smooth Projective Hash Function suffer from the same limitation as classical signatures: at least one part of the computation (messages for signature, witnesses for SPHF) is  ...  In the following, Step 1. is always generated honestly by the simulator, since the hashing and projection keys do not depend on any private value.  ... 
doi:10.1007/978-3-662-53890-6_12 fatcat:plvmsg4ibzhvfaezbf25lxpm4e

Hash Proof Systems over Lattices Revisited [chapter]

Fabrice Benhamouda, Olivier Blazy, Léo Ducas, Willy Quach
2018 Lecture Notes in Computer Science  
Our two-round PAKE is thus the first two-round PAKE  ...  Finally, using our word-independent SPHF together with simulation-sound non-interactive zero-knowledge proofs (SS-NIZK), by following [KV11], we obtain a one-round PAKE.  ...  Acknowledgments We would like to sincerely thank Zvika Brakerski for many useful and interesting discussions.  ... 
doi:10.1007/978-3-319-76581-5_22 fatcat:eocaidwaunhr5ch5avb6jtyjzi

Public-key encryption indistinguishable under plaintext-checkable attacks

Michel Abdalla, Fabrice Benhamouda, David Pointcheval
2016 IET Information Security  
By doing so, we were able to reduce the overall communication complexity of these protocols and obtain the most efficient PAKE schemes to date based on the plain DDH assumption.  ...  The new scheme is a more efficient variant of the Cramer-Shoup encryption scheme with shorter ciphertexts and its security is also based on the plain Decisional Diffie-Hellman (DDH) assumption.  ...  Acknowledgments This work was supported in part by the French ANR-12-INSE-0014 SIMPATIC Project, the CFM Foundation, and the European Research Council under the European Community's Seventh Framework Programme  ... 
doi:10.1049/iet-ifs.2015.0500 fatcat:sd3l6qldyjgenhw5ucknhuy3jq

Mitigating Server Breaches in Password-Based Authentication: Secure and Efficient Solutions [chapter]

Olivier Blazy, Céline Chevalier, Damien Vergnaud
2016 Lecture Notes in Computer Science  
In this paper, we propose two efficient protocols where the password database is somehow shared among two servers (or more), and authentication requires a distributed computation involving the client and  ...  Our protocols rely on smooth projective hash functions and are proven secure under classical assumption in the standard model (i.e. do not require idealized assumption, such as random oracles).  ...  only one round as in the former protocol.  ... 
doi:10.1007/978-3-319-29485-8_1 fatcat:gstbmlp7onfyfdlvmp3uwrkgxq

Disjunctions for Hash Proof Systems: New Constructions and Applications [chapter]

Michel Abdalla, Fabrice Benhamouda, David Pointcheval
2015 Lecture Notes in Computer Science  
first one-round group password-authenticated key exchange without random oracles, the most efficient threshold structure-preserving chosen-ciphertext-secure encryption scheme, and the most efficient one-round  ...  For our NIZK and our new TSPHF, the construction essentially consists in the disjunction of an SPHF for the language in which we are interested, and another SPHF for a language which is used to provide  ...  We would like to thank Jens Groth and the anonymous reviewers for detailed comments on a previous version of this paper. This work was supported in part by the  ... 
doi:10.1007/978-3-662-46803-6_3 fatcat:2o6v7zng75hivgtvp43n4zw3pa

Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages [chapter]

Fabrice Ben Hamouda, Olivier Blazy, Céline Chevalier, David Pointcheval, Damien Vergnaud
2013 Lecture Notes in Computer Science  
But we need smooth projective hash functions on new languages, whose efficient implementations are of independent interest.  ...  PAKE, for Password-Authenticated Key Exchange, was formalized by Bellovin and Merritt [BM92] and followed by many proposals based on different cryptographic assumptions (see [ACP09,CCGS10] and references  ...  Anyway they say, their PAKE scheme is less efficient than [CHK + 05], which needed 6 rounds and around 30 modular exponentiations per user, while our efficient PAKE requires less than 40 exponentiations  ... 
doi:10.1007/978-3-642-36362-7_18 fatcat:3t7maiud6bb6hbp64ngeqattl4

Zero-Knowledge Password Policy Checks and Verifier-Based PAKE [chapter]

Franziskus Kiefer, Mark Manulis
2014 Lecture Notes in Computer Science  
We give general and concrete constructions of ZKPPC protocols and suitable VPAKE protocols for ASCII-based passwords and policies that are commonly used on the web.  ...  To this end we introduce a reversible mapping of ASCII characters to integers that can be used to preserve the structure of the password string and a new randomised password hashing scheme for ASCII-based  ...  The resulting VPAKE protocol can thus still proceed in one round. The smoothness of our SPHF construction for L s H ,H can be proven as follows.  ... 
doi:10.1007/978-3-319-11212-1_17 fatcat:iwrl6tzze5eo7i32jhdciqwapm

Smooth Projective Hashing for Conditionally Extractable Commitments [chapter]

Michel Abdalla, Céline Chevalier, David Pointcheval
2009 Lecture Notes in Computer Science  
by the user without random oracles or zero-knowledge proofs and adaptive security for password-based authenticated key exchange protocols in the universal composability framework with erasures.  ...  Next, we illustrate how the use of smooth projective hash functions with more complex languages can be efficiently associated to extractable commitment schemes and avoid the need for zero-knowledge proofs  ...  Acknowlegments This work was supported in part by the French ANR-07-SESU-008-01 PAMPA Project, and European Commission through the ICT program under contract ICT-2007-216676 ECRYPT II.  ... 
doi:10.1007/978-3-642-03356-8_39 fatcat:a5udzps7xbdhbkpq4l4rpjth44

On the Security of Password-Authenticated Quantum Key Exchange [article]

Céline Chevalier, Marc Kaplan, Quoc Huy Vu
2019 arXiv   pre-print
to be computational during the execution of the protocol, which seems quite a reasonable assumption for nowadays practical use-cases.  ...  We then answer this open question positively by presenting a construction for quantum PAKE that provably achieves everlasting security in the simulation-based model.  ...  Using different tools than SPHF, Jutla and Roy also proposed very efficient UC-secure PAKE schemes [JR15, JR18] .  ... 
arXiv:1904.01526v2 fatcat:w2vwzupckjg3zjaqdlyajuhuvy

Designated-Verifier Anonymous Credential for Identity Management in Decentralized Systems

Xudong Deng, Chengliang Tian, Fei Chen, Hequn Xian, Vishal Sharma
2021 Mobile Information Systems  
DVAC would assist to build a new practical decentralized identity management with anonymity and auditability.  ...  A decentralized solution atop on blockchain will bypass the centralized architecture and address the single point of the failure problem.  ...  [11] proposed a round-optimal asymmetric PAKE protocol, which could construct a new anonymous credential system.  ... 
doi:10.1155/2021/2807395 fatcat:ylc45gaqhvbk3biyguv6x5z6da
« Previous Showing results 1 — 15 out of 18 results