Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages
From MaRDI portal
Recommendations
- Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs
- Information Security and Cryptology - ICISC 2005
- Authenticated key exchange from ideal lattices
- Theory of Cryptography
- Efficient Two-Party Password-Based Key Exchange Protocols in the UC Framework
- Strongly secure authenticated key exchange from factoring, codes, and lattices
- Strongly Secure Authenticated Key Exchange from Factoring, Codes, and Lattices
- Efficient constructions for almost-everywhere secure computation
- Generic Compilers for Authenticated Key Exchange
- New modular compilers for authenticated key exchange
Cites work
- A framework for practical universally composable zero-knowledge protocols
- A more efficient algorithm for lattice basis reduction
- A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra
- Advances in Cryptology - CRYPTO 2003
- Anonymity from Asymmetry: New Constructions for Anonymous HIBE
- Credential authenticated identification and key exchange
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages
- Fast LLL-type lattice reduction
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- Highly-efficient universally-composable commitments based on the DDH assumption
- scientific article; zbMATH DE number 2009978 (Why is no real title available?)
- scientific article; zbMATH DE number 2086698 (Why is no real title available?)
- McPAD: A multiple classifier system for accurate payload-based anomaly detection
- Private Mutual Authentication and Conditional Oblivious Transfer
- Round-optimal privacy-preserving protocols with smooth projective hash functions
- Secure Computation Without Authentication
- Smooth Projective Hashing for Conditionally Extractable Commitments
- Strengthening zero-knowledge protocols using signatures
- Universally Composable Password-Based Key Exchange
Cited in
(14)- Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Practical witness-key-agreement for blockchain-based dark pools financial trading
- Password-authenticated group key establishment from smooth projective hash functions
- Non-Interactive Zero-Knowledge Proofs of Non-Membership
- Generic construction of UC-secure oblivious transfer
- Adaptive oblivious transfer and generalization
- Structure-preserving smooth projective hashing
- Generic Compilers for Authenticated Key Exchange
- A new general framework for secure public key encryption with keyword search
- Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages
- A bivariate polynomial-based cryptographic hard problem and its applications
- Witness-authenticated key exchange, revisited: extensions to groups, improved models, simpler constructions
- A framework for witness encryption from linearly verifiable SNARKs and applications
This page was built for publication: Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4916015)