The following pages link to Probabilistic encryption (Q1057832):
Displaying 50 items.
- (Leveled) Fully Homomorphic Encryption without Bootstrapping (Q92720) (← links)
- Layout randomization and nondeterminism (Q265789) (← links)
- Relations between robustness and RKA security under public-key encryption (Q266278) (← links)
- On the Clark-Jacob version of SPLICE/AS (Q287082) (← links)
- Linear complexity of the \(x^{2} \bmod p\) orbits (Q294691) (← links)
- On secret set schemes (Q294774) (← links)
- Tightly secure signatures and public-key encryption (Q300383) (← links)
- Toward a game theoretic view of secure computation (Q321318) (← links)
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments (Q332270) (← links)
- A semantically secure public key cryptoscheme using bit-pair shadows (Q344780) (← links)
- A thirty year old conjecture about promise problems (Q347124) (← links)
- Privacy and verifiability in voting systems: methods, developments and trends (Q395657) (← links)
- The 2010 Benjamin Franklin Medal in Computer and Cognitive Science presented to Shafrira Goldwasser, Ph.D. (Q398324) (← links)
- Paillier-based publicly verifiable (non-interactive) secret sharing (Q398963) (← links)
- Smooth projective hashing and two-message oblivious transfer (Q421036) (← links)
- More on average case vs approximation complexity (Q430823) (← links)
- Provably-secure time-bound hierarchical key assignment schemes (Q431793) (← links)
- Discrete logarithm based additively homomorphic encryption and secure data aggregation (Q433021) (← links)
- Efficient set operations in the presence of malicious adversaries (Q434343) (← links)
- Computational indistinguishability between quantum states and its cryptographic application (Q434349) (← links)
- Short undeniable signatures based on group homomorphisms (Q451120) (← links)
- Lossy trapdoor functions from homomorphic reproducible encryption (Q456129) (← links)
- An efficient IND-CCA2 secure Paillier-based cryptosystem (Q456166) (← links)
- Cryptographic transformations of non-Shannon sources of information (Q466350) (← links)
- Cloud computing in cryptography and steganography (Q466404) (← links)
- Timed encryption with application to deniable key exchange (Q477191) (← links)
- Security proof of the canonical form of self-synchronizing stream ciphers (Q510485) (← links)
- A full proof of the BGW protocol for perfectly secure multiparty computation (Q514468) (← links)
- On server trust in private proxy auctions (Q608995) (← links)
- Securely obfuscating re-encryption (Q656916) (← links)
- Efficient provably-secure hierarchical key assignment schemes (Q719310) (← links)
- \(k\)-anonymous data collection (Q730905) (← links)
- Key-dependent message security: generic amplification and completeness (Q744344) (← links)
- Better security for deterministic public-key encryption: the auxiliary-input setting (Q744600) (← links)
- Insight of the protection for data security under selective opening attacks (Q778391) (← links)
- Pseudorandom bits for constant depth circuits (Q808707) (← links)
- The design of a secure and fair sealed-bid auction service (Q814236) (← links)
- SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions (Q831176) (← links)
- Protecting the privacy of voters: new definitions of ballot secrecy for e-voting (Q832400) (← links)
- Deciding knowledge in security protocols under equational theories (Q860894) (← links)
- Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks (Q861696) (← links)
- Privacy-preserving algorithms for distributed mining of frequent itemsets (Q867633) (← links)
- Construction of a key-dependent message secure symmetric encryption scheme in the ideal cipher model (Q893865) (← links)
- Spreading alerts quietly and the subgroup escape problem (Q901371) (← links)
- Quantum cryptography beyond quantum key distribution (Q908054) (← links)
- A note on computational indistinguishability (Q910218) (← links)
- An efficient probabilistic encryption scheme (Q912074) (← links)
- Secure circuit evaluation. A protocol based on hiding information from an oracle (Q913487) (← links)
- A new framework for the design and analysis of identity-based identification schemes (Q955014) (← links)
- On the security of public key cryptosystems with a double decryption mechanism (Q975470) (← links)
