The following pages link to Theory of Cryptography (Q5898375):
Displaying 48 items.
- Constructions of dynamic and non-dynamic threshold public-key encryption schemes with decryption consistency (Q278732) (← links)
- On the security of joint signature and encryption revisited (Q350517) (← links)
- Group-oriented fair exchange of signatures (Q433010) (← links)
- Programmable hash functions and their applications (Q434345) (← links)
- Ambiguous optimistic fair exchange: definition and constructions (Q476859) (← links)
- An algebraic framework for Diffie-Hellman assumptions (Q514473) (← links)
- Some (in)sufficient conditions for secure hybrid encryption (Q710738) (← links)
- A generic scheme of plaintext-checkable database encryption (Q781853) (← links)
- Efficient public key encryption with smallest ciphertext expansion from factoring (Q1009067) (← links)
- Direct chosen-ciphertext secure identity-based key encapsulation without random oracles (Q1034629) (← links)
- Upgrading to functional encryption (Q1629441) (← links)
- Chosen ciphertext secure keyed-homomorphic public-key cryptosystems (Q1650427) (← links)
- All-but-many encryption (Q1747665) (← links)
- How to protect privacy in optimistic fair exchange of digital signatures (Q1750341) (← links)
- Group homomorphic encryption: characterizations, impossibility results, and applications (Q1943979) (← links)
- Practical chosen ciphertext secure encryption from factoring (Q1946594) (← links)
- Signcryption schemes with insider security in an ideal permutation model (Q2003346) (← links)
- Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed? (Q2018816) (← links)
- CCA-security from adaptive all-but-one lossy trapdoor functions (Q2049981) (← links)
- Bifurcated signatures: folding the accountability vs. anonymity dilemma into a single private signing scheme (Q2056805) (← links)
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings (Q2061939) (← links)
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model (Q2170058) (← links)
- Secure-channel free searchable encryption with multiple keywords: a generic construction, an instantiation, and its implementation (Q2194864) (← links)
- Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions (Q2210433) (← links)
- Offline witness encryption with semi-adaptive security (Q2229274) (← links)
- Efficient hybrid encryption from ID-based encryption (Q2267789) (← links)
- Tag-KEM/DEM: A new framework for hybrid encryption (Q2482338) (← links)
- An efficient CCA-secure cryptosystem over ideal lattices from identity-based encryption (Q2629405) (← links)
- Towards tight adaptive security of non-interactive key exchange (Q2697896) (← links)
- Stronger Security Notions for Decentralized Traceable Attribute-Based Signatures and More Efficient Constructions (Q2790054) (← links)
- Efficient Completely Non-Malleable and RKA Secure Public Key Encryptions (Q2817809) (← links)
- Improving Practical UC-Secure Commitments Based on the DDH Assumption (Q2827723) (← links)
- Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming (Q2829954) (← links)
- Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN (Q2835589) (← links)
- New Constructions of Efficient Simulation-Sound Commitments Using Encryption and Their Applications (Q2890001) (← links)
- Plaintext-Checkable Encryption (Q2890016) (← links)
- Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions (Q2946437) (← links)
- Efficient Distributed Tag-Based Encryption and Its Application to Group Signatures with Efficient Distributed Traceability (Q2946483) (← links)
- Augmented Learning with Errors: The Untapped Potential of the Error Term (Q2948191) (← links)
- Identification Schemes from Key Encapsulation Mechanisms (Q3011903) (← links)
- Adaptively Secure Non-interactive Threshold Cryptosystems (Q3012950) (← links)
- Non-interactive Confirmer Signatures (Q3073694) (← links)
- Efficient Threshold Encryption from Lossy Trapdoor Functions (Q3102790) (← links)
- Dynamic Threshold Public-Key Encryption with Decryption Consistency from Static Assumptions (Q3194590) (← links)
- Sponge Based CCA2 Secure Asymmetric Encryption for Arbitrary Length Message (Q3194591) (← links)
- Constructions of CCA-Secure Revocable Identity-Based Encryption (Q3194596) (← links)
- Two Efficient Tag-Based Encryption Schemes on Lattices (Q3297485) (← links)
- A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems (Q3408192) (← links)
