All-but-many encryption
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1618044 (Why is no real title available?)
- scientific article; zbMATH DE number 1256767 (Why is no real title available?)
- scientific article; zbMATH DE number 1942445 (Why is no real title available?)
- scientific article; zbMATH DE number 2009955 (Why is no real title available?)
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- scientific article; zbMATH DE number 1406780 (Why is no real title available?)
- A Framework for Efficient and Composable Oblivious Transfer
- Additively homomorphic UC commitments with optimal amortized overhead
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in cryptology - CRYPTO '94. 14th annual international cryptology conference, Santa Barbara, CA, USA, August 21-25, 1994. Proceedings
- Advances in cryptology -- CRYPTO 2008. 28th annual international cryptology conference, Santa Barbara, CA, USA, August 17--21, 2008. 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
- All-but-many lossy trapdoor functions
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
- An efficient noninteractive zero-knowledge proof system for NP with general assumptions
- Analysis and improvement of Lindell's UC-secure commitment schemes
- Building lossy trapdoor functions from lossy encryption
- Compact VSS and efficient homomorphic UC commitments
- Cryptography without (Hardly Any) Secrets ?
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Efficient non-interactive universally composable string-commitment schemes
- Encryption schemes secure against chosen-ciphertext selective opening attacks
- Founding Cryptography on Oblivious Transfer – Efficiently
- Highly-efficient universally-composable commitments based on the DDH assumption
- Improving practical UC-secure commitments based on the DDH assumption
- Lossy trapdoor functions and their applications
- New constructions of efficient simulation-sound commitments using encryption and their applications
- Non-interactive and re-usable universally composable string commitments with adaptive security
- Non-interactive and reusable non-malleable commitment schemes
- On the complexity of UC commitments
- On the complexity of additively homomorphic UC commitments
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Rate-1, linear time and additively homomorphic UC commitments
- SPHF-friendly non-interactive commitments
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
- The Twin Diffie-Hellman Problem and Applications
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
- Theory of cryptography. First theory of cryptography conference, TCC 2004, Cambridge, MA, USA, February 19--21, 2004. Proceedings.
- Universally composable two-party and multi-party secure computation
Cited in
(2)
This page was built for publication: All-but-many encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1747665)
