Reconfigurable cryptography: a flexible approach to long-term security
From MaRDI portal
Recommendations
Cites work
- (Hierarchical) identity-based encryption from affine message authentication
- A forward-secure public-key encryption scheme
- A non-interactive public-key distribution system
- An algebraic framework for Diffie-Hellman assumptions
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient Non-interactive Proof Systems for Bilinear Groups
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- scientific article; zbMATH DE number 1418310 (Why is no real title available?)
- Identity-based cryptosystems and signature schemes
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- On lattices, learning with errors, random linear codes, and cryptography
- On the (im)possibility of obfuscating programs
- Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- The security of the cipher block chaining message authentication code
- Trapdoors for hard lattices and new cryptographic constructions
Cited in
(2)
This page was built for publication: Reconfigurable cryptography: a flexible approach to long-term security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2796136)
