Smooth projective hashing and two-message oblivious transfer
From MaRDI portal
Recommendations
- Smooth Projective Hashing and Two-Message Oblivious Transfer
- Round-optimal privacy-preserving protocols with smooth projective hash functions
- Distributed smooth projective hashing and its application to two-server password authenticated key exchange
- Smooth Projective Hashing for Conditionally Extractable Commitments
- Smooth projective hashing and password-based authenticated key exchange from lattices
- Witness encryption from smooth projective hashing system
- A framework for UC-secure commitments from publicly computable smooth projective hashing
- KDM-security via homomorphic smooth projective hashing
- Smooth zero-knowledge hash functions
- Smooth projective hashing from DDH assumption and d-linear assumption
Cites work
- scientific article; zbMATH DE number 1722674 (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 2085203 (Why is no real title available?)
- scientific article; zbMATH DE number 2086698 (Why is no real title available?)
- Advances in Cryptology - CRYPTO 2003
- Efficient and secure authenticated key exchange using weak passwords
- Efficient commitment schemes with bounded sender and unbounded receiver
- Efficient oblivious transfer protocols
- Probabilistic encryption
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Randomness is linear in space
- Theory of Cryptography
- Universally Composable Password-Based Key Exchange
Cited in
(50)- On black-box complexity of universally composable security in the CRS model
- A gapless code-based hash proof system based on RQC and its applications
- Succinct non-interactive secure computation
- Knowledge encryption and its applications to simulatable protocols with low round-complexity
- Weak zero-knowledge via the Goldreich-Levin theorem
- Three-round secure multiparty computation from black-box two-round oblivious transfer
- Revisited experimental comparison of node-link and matrix representations
- An improved affine equivalence algorithm for random permutations
- Smooth Projective Hashing and Two-Message Oblivious Transfer
- What security can we achieve within 4 rounds?
- Public key encryption with equality test via hash proof system
- Strong authenticated key exchange with auxiliary inputs
- Two-round adaptively secure multiparty computation from standard assumptions
- Two-message statistically sender-private OT from LWE
- One-round strong oblivious signature-based envelope
- A new framework for quantum oblivious transfer
- What Security Can We Achieve Within 4 Rounds?
- Cryptography using \texttt{CAPTCHA} puzzles
- Two-round adaptively secure MPC from isogenies, LPN, or CDH
- A framework for statistically sender private OT with optimal rate
- Round-optimal black-box MPC in the plain model
- Algebraic restriction codes and their applications
- KDM-security via homomorphic smooth projective hashing
- The price of active security in cryptographic protocols
- A framework for UC-secure commitments from publicly computable smooth projective hashing
- Statistically sender-private OT from LPN and derandomization
- 3-message zero knowledge against human ignorance
- Statistical ZAPR arguments from bilinear maps
- Statistical ZAP arguments
- Statistical Zaps and new oblivious transfer protocols
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
- Cryptographic reverse firewall via malleable smooth projective hash functions
- The price of active security in cryptographic protocols
- Two-round oblivious transfer from CDH or LPN
- BETA: biometric-enabled threshold authentication
- Circuit-private multi-key FHE
- Weak Zero-Knowledge beyond the Black-Box Barrier
- Round-optimal black-box multiparty computation from polynomial-time assumptions
- Amortizing rate-1 OT and applications to PIR and PSI
- Lossy cryptography from code-based assumptions
- Cryptographic group actions and applications
- Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers
- A gapless post-quantum hash proof system in the Hamming metric
- On the existence of extractable one-way functions
- Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK
- Two-message, oblivious evaluation of cryptographic functionalities
- A new general framework for secure public key encryption with keyword search
- Statistical security in two-party computation revisited
- Generic construction of UC-secure oblivious transfer
This page was built for publication: Smooth projective hashing and two-message oblivious transfer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q421036)
