scientific article; zbMATH DE number 1302836
From MaRDI portal
Publication:4249318
Recommendations
Cited in
(only showing first 100 items - show all)- Efficient public key encryption with smallest ciphertext expansion from factoring
- Authenticated encryption: relations among notions and analysis of the generic composition paradigm
- Direct chosen-ciphertext secure identity-based key encapsulation without random oracles
- Self-certified multi-proxy signature schemes with message recovery
- The wonderful world of global random oracles
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- HILA5: on reliability, reconciliation, and error correction for Ring LWE encryption
- Robust encryption
- Group homomorphic encryption: characterizations, impossibility results, and applications
- Secure integration of asymmetric and symmetric encryption schemes
- Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?
- Revisiting (R)CCA security and replay protection
- An efficient and generic construction for signal's handshake (X3DH): post-quantum, state leakage secure, and deniable
- Generic transformation from broadcast encryption to round-optimal deniable ring authentication
- Non-malleable functions and their applications
- An efficient and generic construction for signal's handshake (X3DH): post-quantum, state leakage secure, and deniable
- Tightness subtleties for multi-user PKE notions
- Anonymity of NIST PQC round 3 KEMs
- Composable and finite computational security of quantum message transmission
- CPA-to-CCA transformation for KDM security
- Identity-based revocation system: enhanced security model and scalable bounded IBRS construction with short parameters
- Tightly CCA-secure encryption scheme in a multi-user setting with corruptions
- Joint state composition theorems for public-key encryption and digital signature functionalities with local computation
- Efficient chosen-ciphertext secure certificateless threshold key encapsulation mechanism
- Anonymous protocols: notions and equivalence
- IND-CCA secure encryption based on a Zheng-Seberry scheme
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
- How to construct secure proxy cryptosystem
- Naor-Yung paradigm with shared randomness and applications
- Generic constructions of identity-based and certificateless kEMs
- Security models and proof strategies for plaintext-aware encryption
- Lattice-based completely non-malleable public-key encryption in the standard model
- Certificateless threshold cryptosystem secure against chosen-ciphertext attack
- Characterization of security notions for probabilistic private-key encryption
- A public key cryptosystem based on a subgroup membership problem
- Analysis of Gong et al.'s CCA2-secure homomorphic encryption
- Using low-density parity-check codes to improve the McEliece cryptosystem
- scientific article; zbMATH DE number 1618042 (Why is no real title available?)
- scientific article; zbMATH DE number 1670847 (Why is no real title available?)
- Completeness of single-bit projection-KDM security for public key encryption
- Non-malleability under selective opening attacks: implication and separation
- Efficient completely non-malleable and RKA secure public key encryptions
- Naor-Yung Paradigm with Shared Randomness and Applications
- Improving practical UC-secure commitments based on the DDH assumption
- Message transmission with reverse firewalls -- secure communication on corrupted machines
- A key recovery attack on MDPC with CCA security using decoding errors
- Tightly secure signatures and public-key encryption
- Security notions for broadcast encryption
- Unforgeability of re-encryption keys against collusion attack in proxy re-encryption
- Semantic security and key-privacy with random split of St-Gen codes
- Complete characterization of security notions for probabilistic private-key encryption
- Sponge based CCA2 secure asymmetric encryption for arbitrary length message
- Towards Security Notions for White-Box Cryptography
- Robust Encryption
- Simpler CCA-secure public key encryption from lossy trapdoor functions
- Relations Among Notions of Non-malleability for Encryption
- Public Key Encryption and Encryption Emulation Attacks
- A Brief History of Provably-Secure Public-Key Encryption
- Relationship between Two Approaches for Defining the Standard Model PA-ness
- Cramer-Shoup Satisfies a Stronger Plaintext Awareness under a Weaker Assumption
- The Cramer-Shoup Encryption Scheme Is Plaintext Aware in the Standard Model
- A Provable-Security Treatment of the Key-Wrap Problem
- On ciphertext undetectability
- Security on Hybrid Encryption with the Tag-KEM/DEM Framework
- Co-sound Zero-Knowledge with Public Keys
- An identity-based cryptographic model for discrete logarithm and integer factoring based cryptosystem
- Discrete logarithm based additively homomorphic encryption and secure data aggregation
- Computational indistinguishability between quantum states and its cryptographic application
- Equivalence between Semantic Security and Indistinguishability against Chosen Ciphertext Attacks
- New security notions and relations for public-key encryption
- On the semantic security of functional encryption schemes
- Toward RSA-OAEP without random oracles
- Short Integrated PKE+PEKS in Standard Model
- IND-CCA2 secure McEliece-type modification in the standard model
- Cryptography and cryptographic protocols
- A new hybrid encryption scheme
- On the construction of a semantically secure modification of the McEliece cryptosystem
- Automated proofs for asymmetric encryption
- Group rekeying in the exclusive subset-cover framework
- scientific article; zbMATH DE number 2202020 (Why is no real title available?)
- On the Key-Privacy Issue of McEliece Public-Key Encryption
- On Privacy Models for RFID
- Automated proofs for asymmetric encryption
- Relations Among Notions of Plaintext Awareness
- Completely Non-malleable Encryption Revisited
- SAS-Based Group Authentication and Key Agreement Protocols
- Towards Key-Dependent Message Security in the Standard Model
- Security in Communication Networks
- Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk)
- Type-Based Proxy Re-encryption and Its Construction
- Round-Optimal Blind Signatures from Waters Signatures
- A computational interpretation of Dolev-Yao adversaries
- On the multi-output filtering model and its applications
- A cryptographically sound Dolev-Yao style security proof of the Otway-Rees protocol
- A public-key encryption scheme with pseudo-random ciphertexts
- Private information retrieval using trusted hardware
- Soundness of Formal Encryption in the Presence of Key-Cycles
- Security notions for disk encryption
- A novel public-key encryption scheme based on Bass cyclic units in integral group rings
- Multi-instance secure public-key encryption
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 Q4249318)
