All-but-many encryption
From MaRDI portal
Publication:1747665
DOI10.1007/s00145-017-9256-xzbMath1426.94100OpenAlexW2613042197WikidataQ122177726 ScholiaQ122177726MaRDI QIDQ1747665
Publication date: 26 April 2018
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-017-9256-x
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Advances in cryptology -- CRYPTO 2008. 28th annual international cryptology conference, Santa Barbara, CA, USA, August 17--21, 2008. Proceedings
- Advances in cryptology - CRYPTO '94. 14th annual international cryptology conference, Santa Barbara, CA, USA, August 21-25, 1994. Proceedings
- An efficient noninteractive zero-knowledge proof system for NP with general assumptions
- Theory of cryptography. First theory of cryptography conference, TCC 2004, Cambridge, MA, USA, February 19--21, 2004. Proceedings.
- Advances in cryptology -- EUROCRYPT 2004. International conference on the theory and applications of cryptographic techniques, Interlaken, Switzerland, May 2--6, 2004. Proceedings.
- Advances in cryptology -- EUROCRYPT 2008. 27th annual international conference on the theory and applications of cryptographic techniques, Istanbul, Turkey, April 13--17, 2008. Proceedings
- On the Complexity of Additively Homomorphic UC Commitments
- Improving Practical UC-Secure Commitments Based on the DDH Assumption
- Rate-1, Linear Time and Additively Homomorphic UC Commitments
- Building Lossy Trapdoor Functions from Lossy Encryption
- SPHF-Friendly Non-interactive Commitments
- Analysis and Improvement of Lindell’s UC-Secure Commitment Schemes
- New Constructions of Efficient Simulation-Sound Commitments Using Encryption and Their Applications
- All-But-Many Lossy Trapdoor Functions
- Compact VSS and Efficient Homomorphic UC Commitments
- Additively Homomorphic UC Commitments with Optimal Amortized Overhead
- Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption
- Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security
- Lossy trapdoor functions and their applications
- Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks
- Universally composable two-party and multi-party secure computation
- Non-interactive and reusable non-malleable commitment schemes
- A Framework for Efficient and Composable Oblivious Transfer
- Founding Cryptography on Oblivious Transfer – Efficiently
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Cryptography without (Hardly Any) Secrets ?
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
- Efficient Non-interactive Universally Composable String-Commitment Schemes
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Efficient Identity-Based Encryption Without Random Oracles
- On the Complexity of UC Commitments
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - CRYPTO 2003
- The Twin Diffie-Hellman Problem and Applications
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
This page was built for publication: All-but-many encryption
