scientific article

Publication date: 23 June 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zero-knowledge protocols electronic voting Paillier's probabilistic public key system receipt-free elections threshold variant

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Efficient set intersection with simulation-based security ⋮ New Constructions of Efficient Simulation-Sound Commitments Using Encryption and Their Applications ⋮ Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting ⋮ Counterexamples to new circular security assumptions underlying iO ⋮ Large message homomorphic secret sharing from DCR and applications ⋮ Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts ⋮ Super-strong RKA secure MAC, PKE and SE from tag-based hash proof system ⋮ Rate-limited secure function evaluation ⋮ Algebraic secret sharing using privacy homomorphisms for IoT-based healthcare systems ⋮ Privacy-preserving algorithms for distributed mining of frequent itemsets ⋮ Secure multiparty computation with free branching ⋮ One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model ⋮ Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model ⋮ Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles ⋮ Compressible FHE with applications to PIR ⋮ A verifiable secret shuffle of homomorphic encryptions ⋮ Privacy-preserving Krawtchouk moment feature extraction over encrypted image data ⋮ Cryptographic algorithms for privacy-preserving online applications ⋮ Paillier-based publicly verifiable (non-interactive) secret sharing ⋮ A generic construction of tightly secure signatures in the multi-user setting ⋮ New ways to garble arithmetic circuits ⋮ Transparent batchable time-lock puzzles and applications to Byzantine consensus ⋮ Efficient KDM-CCA Secure Public-Key Encryption for Polynomial Functions ⋮ Zero-knowledge arguments for subverted RSA groups ⋮ How to verifiably encrypt many bits for an election? ⋮ Efficient RSA key generation and threshold Paillier in the two-party setting ⋮ Rate-1 incompressible encryption from standard assumptions ⋮ Chosen-ciphertext secure code-based threshold public key encryptions with short ciphertext ⋮ Threshold linearly homomorphic encryption on $\mathrm{Z}/2^k\mathrm{Z}$ ⋮ Cumulatively all-lossy-but-one trapdoor functions from standard assumptions ⋮ Public-Key Cryptosystems with Primitive Power Roots of Unity ⋮ Fully-Simulatable Oblivious Set Transfer ⋮ An algebraic framework for silent preprocessing with trustless setup and active security ⋮ Zero-knowledge range arguments for signed fractional numbers from lattices ⋮ Group homomorphic encryption: characterizations, impossibility results, and applications ⋮ More constructions of lossy and correlation-secure trapdoor functions ⋮ Efficient set operations in the presence of malicious adversaries ⋮ Asynchronous Multi-Party Computation with Quadratic Communication ⋮ Laconic private set intersection and applications ⋮ Two Generic Constructions of Probabilistic Cryptosystems and Their Applications ⋮ An RSA-Based (t,n) Threshold Proxy Signature Scheme without Any Trusted Combiner ⋮ New Communication-Efficient Oblivious Transfer Protocols Based on Pairings ⋮ Hypercubes and Private Information Retrieval ⋮ Quadratic Error Minimization in a Distributed Environment with Privacy Preserving ⋮ Benaloh’s Dense Probabilistic Encryption Revisited ⋮ All-but-many encryption ⋮ CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions ⋮ Circuit-Private Multi-key FHE ⋮ Scalable Multi-party Private Set-Intersection ⋮ Two methods of directly constructing probabilistic public-key encryption primitives based on third-order LFSR sequences ⋮ Candidate iO from homomorphic encryption schemes ⋮ Efficient Binary Conversion for Paillier Encrypted Values ⋮ Oblivious DFA evaluation on joint input and its applications ⋮ On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles ⋮ Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries ⋮ Communication Optimal Tardos-Based Asymmetric Fingerprinting ⋮ Linearly Homomorphic Encryption from $$\mathsf {DDH}$$ ⋮ Equivocal Blind Signatures and Adaptive UC-Security ⋮ SuperTrust – A Secure and Efficient Framework for Handling Trust in Super Peer Networks ⋮ Fast secure two-party ECDSA signing ⋮ Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems ⋮ A communication-efficient private matching scheme in client-server model ⋮ Round-optimal secure multi-party computation ⋮ Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM ⋮ Preserving worker privacy in crowdsourcing ⋮ Communication-Efficient Private Protocols for Longest Common Subsequence ⋮ Private multiparty sampling and approximation of vector combinations ⋮ Candidate iO from homomorphic encryption schemes ⋮ Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security ⋮ Better Preprocessing for Secure Multiparty Computation ⋮ Simulatable Adaptive Oblivious Transfer with Statistical Receiver’s Privacy ⋮ General Construction of Chameleon All-But-One Trapdoor Functions ⋮ Hybrid commitments and their applications to zero-knowledge proof systems ⋮ Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings ⋮ A geometric approach to homomorphic secret sharing ⋮ BETA: biometric-enabled threshold authentication ⋮ Filling the gap between voters and cryptography in e-voting ⋮ On Constructing Homomorphic Encryption Schemes from Coding Theory ⋮ Efficiency Limitations for Σ-Protocols for Group Homomorphisms ⋮ Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library ⋮ A Tamper-Evident Voting Machine Resistant to Covert Channels ⋮ Security analysis and improvement of a double-trapdoor encryption scheme ⋮ A research on new public-key encryption schemes ⋮ Optimally Sound Sigma Protocols Under DCRA ⋮ A Simpler Rate-Optimal CPIR Protocol ⋮ Incompressible encodings ⋮ Always have a backup plan: fully secure synchronous MPC with asynchronous fallback ⋮ Two-sided malicious security for private intersection-sum with cardinality