Structure-preserving smooth projective hashing
From MaRDI portal
Recommendations
- Smooth Projective Hashing for Conditionally Extractable Commitments
- New techniques for SPHFs and efficient one-round PAKE protocols
- Distributed smooth projective hashing and its application to two-server password authenticated key exchange
- A framework for UC-secure commitments from publicly computable smooth projective hashing
- SPHF-friendly non-interactive commitments
Cites work
- A Framework for Efficient and Composable Oblivious Transfer
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Advances in Cryptology – CRYPTO 2004
- An algebraic framework for Diffie-Hellman assumptions
- Analysis and improvement of Lindell's UC-secure commitment schemes
- Authenticated key exchange secure against dictionary attacks
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Efficient oblivious transfer protocols
- Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages
- Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
- Generic construction of UC-secure oblivious transfer
- Highly-efficient universally-composable commitments based on the DDH assumption
- scientific article; zbMATH DE number 1722673 (Why is no real title available?)
- scientific article; zbMATH DE number 1808213 (Why is no real title available?)
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- scientific article; zbMATH DE number 1302835 (Why is no real title available?)
- scientific article; zbMATH DE number 2009978 (Why is no real title available?)
- scientific article; zbMATH DE number 2086698 (Why is no real title available?)
- scientific article; zbMATH DE number 2086716 (Why is no real title available?)
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- New techniques for SPHFs and efficient one-round PAKE protocols
- Non-interactive and re-usable universally composable string commitments with adaptive security
- Non-Interactive Zero-Knowledge Proofs of Non-Membership
- Oblivious signature-based envelope
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- Round-optimal password-based authenticated key exchange
- Round-optimal privacy-preserving protocols with smooth projective hash functions
- Secure Computation Without Authentication
- Smooth projective hashing and password-based authenticated key exchange from lattices
- Smooth Projective Hashing and Two-Message Oblivious Transfer
- Smooth Projective Hashing for Conditionally Extractable Commitments
- SPHF-friendly non-interactive commitments
- Structure-preserving signatures and commitments to group elements
- Structure-preserving signatures from standard assumptions, revisited
- Structure-preserving signatures from type II pairings
- Structure-preserving smooth projective hashing
- Tagged one-time signatures: tight security and optimal tag size
- Theory of Cryptography
- Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
- Universally Composable Password-Based Key Exchange
- Universally composable two-party and multi-party secure computation
- Universally-Composable Two-Party Computation in Two Rounds
Cited in
(16)- Smooth NIZK arguments
- Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs
- Latent structure preserving hashing
- Hardware security without secure hardware: how to decrypt with a password and a server
- SPHF-friendly non-interactive commitments
- Round-optimal privacy-preserving protocols with smooth projective hash functions
- Structure-preserving smooth projective hashing
- Smooth Projective Hashing for Conditionally Extractable Commitments
- Lossy Projective Hashing and Its Applications
- Distributed smooth projective hashing and its application to two-server password authenticated key exchange
- Removing erasures with explainable hash proof systems
- Smooth zero-knowledge hash functions
- Almost optimal oblivious transfer from QA-NIZK
- On structure-preserving cryptography and lattices
- A framework for witness encryption from linearly verifiable SNARKs and applications
- Laconic PSI on authenticated inputs and applications
This page was built for publication: Structure-preserving smooth projective hashing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953782)
