Structure-Preserving Smooth Projective Hashing

DOI10.1007/978-3-662-53890-6_12zbMath1407.94088OpenAlexW2550403739MaRDI QIDQ2953782

Céline Chevalier, Olivier Blazy

Publication date: 6 January 2017

Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53890-6_12

zbMATH Keywords

credentialsstructure preservingoblivious transferpassword authenticated key exchangesmooth projective hash functionsUC framework

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Smooth NIZK arguments ⋮ Hardware security without secure hardware: how to decrypt with a password and a server ⋮ Structure-Preserving Smooth Projective Hashing ⋮ Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-Interactive Zero-Knowledge Proofs of Non-Membership
• Generic Construction of UC-Secure Oblivious Transfer
• New Techniques for SPHFs and Efficient One-Round PAKE Protocols
• An Algebraic Framework for Diffie-Hellman Assumptions
• SPHF-Friendly Non-interactive Commitments
• Analysis and Improvement of Lindell’s UC-Secure Commitment Schemes
• Structure-Preserving Signatures from Type II Pairings
• Round-Optimal Privacy-Preserving Protocols with Smooth Projective Hash Functions
• Structure-Preserving Smooth Projective Hashing
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• Round-Optimal Password-Based Authenticated Key Exchange
• Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption
• Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security
• Smooth Projective Hashing for Conditionally Extractable Commitments
• Structure-Preserving Signatures from Standard Assumptions, Revisited
• Universally composable two-party and multi-party secure computation
• Structure-Preserving Signatures and Commitments to Group Elements
• A Framework for Efficient and Composable Oblivious Transfer
• Universally-Composable Two-Party Computation in Two Rounds
• Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
• Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions
• Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS
• Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages
• Tagged One-Time Signatures: Tight Security and Optimal Tag Size
• Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
• Advances in Cryptology – CRYPTO 2004
• Smooth Projective Hashing and Two-Message Oblivious Transfer
• Universally Composable Password-Based Key Exchange
• Secure Computation Without Authentication
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
• Oblivious signature-based envelope
• Theory of Cryptography

This page was built for publication: Structure-Preserving Smooth Projective Hashing