Pages that link to "Item:Q3562883"
From MaRDI portal
The following pages link to Public Key Cryptography – PKC 2010 (Q3562883):
Displayed 29 items.
- Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model (Q3562884) (← links)
- Constant Size Ciphertexts in Threshold Attribute-Based Encryption (Q3562885) (← links)
- Algebraic Cryptanalysis of the PKC’2009 Algebraic Surface Cryptosystem (Q3562886) (← links)
- Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA (Q3562887) (← links)
- Implicit Factoring with Shared Most Significant and Middle Bits (Q3562889) (← links)
- On the Feasibility of Consistent Computations (Q3562890) (← links)
- Multi-query Computationally-Private Information Retrieval with Constant Communication Rate (Q3562891) (← links)
- Further Observations on Optimistic Fair Exchange Protocols in the Multi-user Setting (Q3562892) (← links)
- Secure Network Coding over the Integers (Q3562893) (← links)
- Preventing Pollution Attacks in Multi-source Network Coding (Q3562894) (← links)
- Groth–Sahai Proofs Revisited (Q3562895) (← links)
- Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments (Q3562896) (← links)
- Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions (Q3562897) (← links)
- Faster Pairing Computations on Curves with High-Degree Twists (Q3562898) (← links)
- Efficient Arithmetic on Hessian Curves (Q3562899) (← links)
- CCA Proxy Re-Encryption without Bilinear Maps in the Standard Model (Q3562901) (← links)
- More Constructions of Lossy and Correlation-Secure Trapdoor Functions (Q3562902) (← links)
- Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions (Q3562904) (← links)
- Efficient Set Operations in the Presence of Malicious Adversaries (Q3562905) (← links)
- Text Search Protocols with Simulation Based Security (Q3562906) (← links)
- Solving a 676-Bit Discrete Logarithm Problem in GF(36n ) (Q3562907) (← links)
- Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval (Q3562909) (← links)
- Functional Encryption for Inner Product: Achieving Constant-Size Ciphertexts with Adaptive Security or Support for Negation (Q3562910) (← links)
- Security of Encryption Schemes in Weakened Random Oracle Models (Q3562912) (← links)
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes (Q3562913) (← links)
- Unlinkability of Sanitizable Signatures (Q3562914) (← links)
- Confidential Signatures and Deterministic Signcryption (Q3562915) (← links)
- Identity-Based Aggregate and Multi-Signature Schemes Based on RSA (Q3562916) (← links)
- Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More (Q3562917) (← links)