Zero-knowledge range arguments for signed fractional numbers from lattices

DOI10.1007/978-3-031-20917-8_9MaRDI QIDQ6173119zbMATH OpenFDO

Authors Priyanka Dutta, Dung Hoang Duong, Willy Susilo, Kazuhide Fukushima, Shinsaku Kiyomoto

Publication date 21 July 2023

Published in Provable and Practical Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-20917-8_9

zbMATH Keywords

range proofszero-knowledge range argument system

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Lattice-based zero-knowledge arguments for integer relations
• Efficient range proofs with transparent setup from bounded integer commitments
• Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
• A secure and efficient proof of integer in an interval range
• Efficient zero-knowledge arguments from two-tiered homomorphic commitments

Cites work

• A new paradigm for public key identification
• Advances in Cryptology - ASIACRYPT 2003
• Collusion-resistant identity-based proxy re-encryption: lattice-based constructions in standard model
• Commitments and efficient zero-knowledge proofs from learning parity with noise
• Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
• Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
• Efficient proofs that a committed number lies in an interval
• Efficient Protocols for Set Membership and Range Proofs
• Efficient range proofs with transparent setup from bounded integer commitments
• Efficient zero-knowledge arguments from two-tiered homomorphic commitments
• Hardness of SIS and LWE with small parameters
• scientific article; zbMATH DE number 1618044 (Why is no real title available?)
• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• Lattice RingCT v2.0 with multiple input and multiple output wallets
• Lattice-based e-cash, revisited
• Lattice-based HRA-secure attribute-based proxy re-encryption in standard model
• Lattice-based proof of shuffle and applications to electronic voting
• Lattice-based zero-knowledge arguments for integer relations
• New code-based privacy-preserving cryptographic constructions
• New Techniques for Non-interactive Shuffle and Range Arguments
• Non-interactive Zero-Knowledge Arguments for Voting
• Puncturable identity-based and attribute-based encryption from lattices
• Puncturable Identity-Based Encryption from Lattices
• Rational modular encoding in the DCR setting: non-interactive range proofs and Paillier-based Naor-Yung in the standard model
• Removing the strong RSA assumption from arguments over the integers
• Secure Vickrey auctions without threshold trust
• Strictly-black-box zero-knowledge and efficient validation of financial transactions
• Trapdoors for hard lattices and new cryptographic constructions
• Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
• Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
• Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption

Cited in

(2)

• Lattice-based zero-knowledge arguments for integer relations
• Rational modular encoding in the DCR setting: non-interactive range proofs and Paillier-based Naor-Yung in the standard model

This page was built for publication: Zero-knowledge range arguments for signed fractional numbers from lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6173119)