Efficient proofs that a committed number lies in an interval
From MaRDI portal
Publication:3374927
Recommendations
Cited in
(47)- Towards restricting plaintext space in public key encryption
- A secure and efficient proof of integer in an interval range
- Efficient, Robust and Constant-Round Distributed RSA Key Generation
- On the Portability of Generalized Schnorr Proofs
- Privacy-Preserving Similarity Evaluation and Application to Remote Biometrics Authentication
- A general, flexible and efficient proof of inclusion and exclusion
- New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
- Practical Range Proof for Cryptocurrency Monero with Provable Security
- A Novel Range Test
- Privacy-preserving data aggregation with probabilistic range validation
- Cryptanalysis and improvement of an ID-based ad-hoc anonymous identification scheme at CT-RSA 05
- Efficient Protocols for Set Membership and Range Proofs
- A reduction of security notions in designated confirmer signatures
- Augmented oblivious polynomial evaluation protocol and its applications
- Compact E-Cash and Simulatable VRFs Revisited
- scientific article; zbMATH DE number 1504550 (Why is no real title available?)
- Zero-knowledge range arguments for signed fractional numbers from lattices
- Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use
- Electronic jury voting protocols
- A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem
- Zero-Knowledge Authenticated Order Queries and Order Statistics on a List
- Efficient Non-interactive Range Proof
- A framework for constructing convertible undeniable signatures
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer
- On server trust in private proxy auctions
- Rational modular encoding in the DCR setting: non-interactive range proofs and Paillier-based Naor-Yung in the standard model
- Towards zero knowledge argument for double discrete logarithm with constant cost
- How to deal with malicious users in privacy‐preserving distributed data mining
- Secure authenticated comparisons
- Zero-knowledge arguments for subverted RSA groups
- Several cryptographic applications of \(\Sigma\)-protocol
- Multilevel threshold secret sharing based on the Chinese remainder theorem
- Encryption switching protocols
- Removing the strong RSA assumption from arguments over the integers
- Vector commitments with proofs of smallness: short range proofs and more
- Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms
- Efficient range proofs with transparent setup from bounded integer commitments
- Signatures and efficient proofs on committed graphs and NP-statements
- Fast secure two-party ECDSA signing
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Efficiency limitations for \(\Sigma \)-protocols for group homomorphisms
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Two-sided malicious security for private intersection-sum with cardinality
- Universally composable \(\varSigma \)-protocols in the global random-oracle model
- Sanitizable Signatures Revisited
- Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries
- Efficient Binary Conversion for Paillier Encrypted Values
This page was built for publication: Efficient proofs that a committed number lies in an interval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374927)
