Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions
From MaRDI portal
Publication:2946437
Recommendations
- Efficient completely non-malleable and RKA secure public key encryptions
- Efficient KDM-CCA secure public-key encryption for polynomial functions
- RKA security beyond the linear barrier: IBE, encryption and signatures
- Generalized IBE in the exponent-inversion framework
- Notions and relations for RKA-secure permutation and function families
- On the practical security of inner product functional encryption
- Efficient circuit-size independent public key encryption with KDM security
- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
- Efficient lattice-based inner-product functional encryption
- Information Security
Cites work
- scientific article; zbMATH DE number 1024009 (Why is no real title available?)
- scientific article; zbMATH DE number 2009976 (Why is no real title available?)
- scientific article; zbMATH DE number 1394311 (Why is no real title available?)
- Advances in cryptology - CRYPTO 2010. 30th annual cryptology conference, Santa Barbara, CA, USA, August 15--19, 2010. Proceedings
- Advances in cryptology -- ASIACRYPT 2011. 17th international conference on the theory and application of cryptology and information security, Seoul, South Korea, December 4--8, 2011. Proceedings
- BiTR: built-in tamper resilience
- Chosen‐Ciphertext Security from Identity‐Based Encryption
- Continuous non-malleable key derivation and its application to related-key security
- Correlated-input secure hash functions
- Cryptography secure against related-key attacks and tampering
- Cryptography with tamperable and leaky memory
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient chosen-ciphertext security via extractable hash proofs
- Efficient non-malleable codes and key-derivation for poly-size tampering circuits
- Efficient selective identity-based encryption without random oracles
- Improved constructions of PRFs secure against related-key attacks
- Modern computer algebra
- New types of cryptanalytic attacks using related keys
- Non-malleable codes
- Non-malleable codes from additive combinatorics (extended abstract)
- On the importance of eliminating errors in cryptographic computations
- On the joint security of encryption and signature, revisited
- Pseudorandom functions and permutations provably secure against related-key attacks
- Public Key Encryption against Related Key Attacks
- RKA secure PKE based on the DDH and HR assumptions
- RKA security beyond the linear barrier: IBE, encryption and signatures
- Related key secure PKE from hash proof systems
- Related-key security for pseudorandom functions beyond the linear barrier
- Tamper and Leakage Resilience in the Split-State Model
- Tamper detection and continuous non-malleable codes
- Theory of Cryptography
- Theory of Cryptography
Cited in
(7)- How to make the Cramer-Shoup cryptosystem secure against linear related-key attacks
- RKA security beyond the linear barrier: IBE, encryption and signatures
- Efficient completely non-malleable and RKA secure public key encryptions
- Impossibility on tamper-resilient cryptography with uniqueness properties
- Related-key secure key encapsulation from extended computational bilinear Diffie-Hellman
- Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions
- Don't tamper with dual system encryption. Beyond polynomial related-key security of IBE
This page was built for publication: Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946437)
