scientific article
From MaRDI portal
Publication:3374927
zbMath1082.94534MaRDI QIDQ3374927
Publication date: 1 March 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (43)
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting ⋮ A reduction of security notions in designated confirmer signatures ⋮ Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms ⋮ Efficient Non-interactive Range Proof ⋮ Electronic jury voting protocols ⋮ Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model ⋮ On server trust in private proxy auctions ⋮ Signatures and Efficient Proofs on Committed Graphs and NP-Statements ⋮ How to deal with malicious users in privacy‐preserving distributed data mining ⋮ Zero-knowledge arguments for subverted RSA groups ⋮ Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use ⋮ Efficient RSA key generation and threshold Paillier in the two-party setting ⋮ Universally composable \(\varSigma \)-protocols in the global random-oracle model ⋮ Zero-knowledge range arguments for signed fractional numbers from lattices ⋮ Multilevel threshold secret sharing based on the Chinese remainder theorem ⋮ Privacy-Preserving Similarity Evaluation and Application to Remote Biometrics Authentication ⋮ Blind Identity-Based Encryption and Simulatable Oblivious Transfer ⋮ Several cryptographic applications of \(\Sigma\)-protocol ⋮ Practical Range Proof for Cryptocurrency Monero with Provable Security ⋮ Secure Authenticated Comparisons ⋮ Removing the Strong RSA Assumption from Arguments over the Integers ⋮ A Framework for Constructing Convertible Undeniable Signatures ⋮ Efficient Binary Conversion for Paillier Encrypted Values ⋮ Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries ⋮ Efficient Protocols for Set Membership and Range Proofs ⋮ Cryptanalysis and improvement of an ID-based ad-hoc anonymous identification scheme at CT-RSA 05 ⋮ Fast secure two-party ECDSA signing ⋮ Zero-Knowledge Authenticated Order Queries and Order Statistics on a List ⋮ A General, Flexible and Efficient Proof of Inclusion and Exclusion ⋮ On the Portability of Generalized Schnorr Proofs ⋮ Efficient range proofs with transparent setup from bounded integer commitments ⋮ New RSA-Based (Selectively) Convertible Undeniable Signature Schemes ⋮ Compact E-Cash and Simulatable VRFs Revisited ⋮ Towards Restricting Plaintext Space in Public Key Encryption ⋮ A Secure and Efficient Proof of Integer in an Interval Range ⋮ Encryption Switching Protocols ⋮ Efficient, Robust and Constant-Round Distributed RSA Key Generation ⋮ Efficiency Limitations for Σ-Protocols for Group Homomorphisms ⋮ Sanitizable Signatures Revisited ⋮ A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem ⋮ Two-sided malicious security for private intersection-sum with cardinality ⋮ Augmented Oblivious Polynomial Evaluation Protocol and Its Applications ⋮ Privacy-preserving data aggregation with probabilistic range validation
This page was built for publication:
