New Techniques for SPHFs and Efficient One-Round PAKE Protocols

From MaRDI portal
Publication:2845688

DOI10.1007/978-3-642-40041-4_25zbMath1310.94125OpenAlexW1947829872WikidataQ56920995 ScholiaQ56920995MaRDI QIDQ2845688

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

Publication date: 2 September 2013

Published in: Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40041-4_25




Related Items (25)

Smooth NIZK argumentsReceiver-anonymity in rerandomizable RCCA-secure cryptosystems resolvedImplicit Zero-Knowledge Arguments and Applications to the Malicious SettingA New General Framework for Secure Public Key Encryption with Keyword SearchVerifier-based anonymous password-authenticated key exchange protocol in the standard modelHardware security without secure hardware: how to decrypt with a password and a serverQANIZK for adversary-dependent languages and their applicationsAdaptive Oblivious Transfer and GeneralizationStructure-Preserving Smooth Projective HashingEKE meets tight security in the universally composable frameworkChosen ciphertext secure keyed two-level homomorphic encryptionWitness encryption from smooth projective hashing systemCryptographic Reverse Firewall via Malleable Smooth Projective Hash FunctionsEfficient NIZKs for algebraic setsSmooth zero-knowledge hash functionsFuzzy asymmetric password-authenticated key exchangePredictable Arguments of KnowledgeRemoving Erasures with Explainable Hash Proof SystemsNon-Interactive Zero-Knowledge Proofs of Non-MembershipGeneric Construction of UC-Secure Oblivious TransferPractical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofsOne-Round Strong Oblivious Signature-Based EnvelopePublic key encryption with equality test via hash proof system(Commit-and-prove) predictable arguments with privacyA gapless code-based hash proof system based on RQC and its applications




This page was built for publication: New Techniques for SPHFs and Efficient One-Round PAKE Protocols