Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model
From MaRDI portal
Publication:5087275
DOI10.1007/978-3-030-97121-2_22zbMath1492.94089MaRDI QIDQ5087275
No author found.
Publication date: 8 July 2022
Published in: Public-Key Cryptography – PKC 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-97121-2_22
94A60: Cryptography
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Threshold cryptosystems from threshold fully homomorphic encryption
- Efficient range proofs with transparent setup from bounded integer commitments
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- On adaptive security of delayed-input sigma protocols and Fiat-Shamir NIZKs
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Zether: towards privacy in a smart contract world
- Simulation-sound arguments for LWE and applications to KDM-CCA2 security
- Communication Optimal Tardos-Based Asymmetric Fingerprinting
- New Techniques for Non-interactive Shuffle and Range Arguments
- Non-interactive CCA-Secure Threshold Cryptosystems with Adaptive Security: New Framework and Constructions
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Making Sigma-Protocols Non-interactive Without Random Oracles
- Secure Vickrey Auctions without Threshold Trust
- CryptoComputing with Rationals
- Integer Programming with a Fixed Number of Variables
- The random oracle methodology, revisited
- Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
- Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments
- Universally Composable Adaptive Priced Oblivious Transfer
- Non-interactive Zero-Knowledge Arguments for Voting
- Efficient Protocols for Set Membership and Range Proofs
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- Noninteractive Zero-Knowledge
- Gauss' algorithm revisited
- Securing threshold cryptosystems against chosen ciphertext attack
- An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Fiat-Shamir: from practice to theory
- Advances in Cryptology – CRYPTO 2004
- New Techniques for Noninteractive Zero-Knowledge
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Removing the Strong RSA Assumption from Arguments over the Integers
- Optimally Sound Sigma Protocols Under DCRA
- Topics in Cryptology – CT-RSA 2006
- On lattices, learning with errors, random linear codes, and cryptography
- Advances in Cryptology - ASIACRYPT 2003
