scientific article; zbMATH DE number 1759349
From MaRDI portal
Publication:4536289
Recommendations
Cited in
(34)- Filling the gap between voters and cryptography in e-voting
- Shared generation of pseudo-random functions
- Secure rational numbers equivalence test based on threshold cryptosystem with rational numbers
- An information theoretically secure e-lottery scheme based on symmetric bivariate polynomials
- Threshold cryptography based on Asmuth-Bloom secret sharing
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Provably secure threshold paillier encryption based on hyperplane geometry
- TTP smartcard-based ElGamal cryptosystem using threshold scheme for electronic elections
- Efficient RSA key generation and threshold Paillier in the two-party setting
- A secure reverse multi-attribute first-price E-auction mechanism using multiple auctioneer servers (work in progress)
- Cryptocomputing with rationals
- Asynchronous Multi-Party Computation with Quadratic Communication
- Efficient Binary Conversion for Paillier Encrypted Values
- Fair Threshold Decryption with Semi-Trusted Third Parties
- Practical Threshold Signatures with Linear Secret Sharing Schemes
- Paillier-based publicly verifiable (non-interactive) secret sharing
- Efficient set operations in the presence of malicious adversaries
- scientific article; zbMATH DE number 2043334 (Why is no real title available?)
- Formal and precise analysis of soundness of several shuffling schemes
- Efficient oblivious transfer from lossy threshold homomorphic encryption
- Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer
- A new distribution version of Boneh-Goh-Nissim cryptosystem : Security and performance analysis
- Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library
- A Tamper-Evident Voting Machine Resistant to Covert Channels
- Hiding the input-size in multi-party private set intersection
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)
- Resource fairness and composability of cryptographic protocols
- Threshold Niederreiter: chosen-ciphertext security and improved distributed decoding
- Resolving the efficiency-utility dilemma of threshold linearly homomorphic encryption via message-space adapter
- Traceable verifiable random functions
- Quantum (t, n) threshold signature based on shift-code operation and Lagrange unitary operation
- Tiresias: large scale, UC-secure threshold Paillier
- Efficient oblivious transfer for one-sided active adaptive adversaries
- Protecting the privacy of voters: new definitions of ballot secrecy for e-voting
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536289)
