A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions
From MaRDI portal
Publication:2025352
DOI10.3934/amc.2020046zbMath1464.94029OpenAlexW2991446912MaRDI QIDQ2025352
Publication date: 12 May 2021
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2020046
code-based cryptographypost-quantum cryptographyuniversal composabilitycommmitmentglobal random oracle
Cryptography (94A60) Information theory (general) (94A15) Source coding (94A29) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved quantum information set decoding
- The wonderful world of global random oracles
- LPN decoded
- Improving Practical UC-Secure Commitments Based on the DDH Assumption
- Rate-1, Linear Time and Additively Homomorphic UC Commitments
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Additively Homomorphic UC Commitments with Optimal Amortized Overhead
- Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption
- Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security
- Universally composable two-party and multi-party secure computation
- A Framework for Efficient and Composable Oblivious Transfer
- On the inherent intractability of certain coding problems (Corresp.)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Weak keys in the McEliece public-key cryptosystem
- Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
- A Distinguisher for High-Rate McEliece Cryptosystems
- On the Complexity of UC Commitments
- Theory of Cryptography
This page was built for publication: A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions
