Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages

DOI10.1007/978-3-642-36362-7_18zbMath1292.94168OpenAlexW1502380013WikidataQ56920985 ScholiaQ56920985MaRDI QIDQ4916015

Olivier Blazy, Damien Vergnaud, David Pointcheval, Fabrice Benhamouda, Céline Chevalier

Publication date: 19 April 2013

Published in: Public-Key Cryptography – PKC 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36362-7_18

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (11)

Practical witness-key-agreement for blockchain-based dark pools financial trading ⋮ A New General Framework for Secure Public Key Encryption with Keyword Search ⋮ Adaptive Oblivious Transfer and Generalization ⋮ Structure-Preserving Smooth Projective Hashing ⋮ A bivariate polynomial-based cryptographic hard problem and its applications ⋮ Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages ⋮ Non-Interactive Zero-Knowledge Proofs of Non-Membership ⋮ Generic Construction of UC-Secure Oblivious Transfer ⋮ Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs ⋮ Password-authenticated group key establishment from smooth projective hash functions ⋮ Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages

Cites Work

• Unnamed Item
• Unnamed Item
• McPAD: A multiple classifier system for accurate payload-based anomaly detection
• Gradual sub-lattice reduction and a new complexity for factoring polynomials
• Fast LLL-type lattice reduction
• Strengthening zero-knowledge protocols using signatures
• Round-Optimal Privacy-Preserving Protocols with Smooth Projective Hash Functions
• Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption
• A Framework for Practical Universally Composable Zero-Knowledge Protocols
• Private Mutual Authentication and Conditional Oblivious Transfer
• Smooth Projective Hashing for Conditionally Extractable Commitments
• Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
• Credential Authenticated Identification and Key Exchange
• A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra
• A more efficient algorithm for lattice basis reduction
• Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages
• Anonymity from Asymmetry: New Constructions for Anonymous HIBE
• Efficient Identity-Based Encryption Without Random Oracles
• Universally Composable Password-Based Key Exchange
• Advances in Cryptology - CRYPTO 2003
• Secure Computation Without Authentication
• Efficient Non-interactive Proof Systems for Bilinear Groups

This page was built for publication: Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages