The following pages link to Rosario Gennaro (Q290377):
Displaying 50 items.
- Automata evaluation and text search protocols with simulation-based security (Q290379) (← links)
- Algebraic (trapdoor) one-way functions: constructions and applications (Q500981) (← links)
- An improved pseudo-random generator based on the discrete logarithm problem (Q814844) (← links)
- Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring (Q868950) (← links)
- Secure distributed key generation for discrete-log based cryptosystems (Q882774) (← links)
- New approaches for deniable authentication (Q1037236) (← links)
- Secure multiplication of shared secrets in the exponent (Q1044710) (← links)
- (Q1575649) (redirect page) (← links)
- Secure distributed storage and retrieval (Q1575652) (← links)
- New efficient and secure protocols for verifiable signature sharing and other applications (Q1582011) (← links)
- RSA-based undeniable signatures (Q1590358) (← links)
- Securing threshold cryptosystems against chosen ciphertext attack (Q1601827) (← links)
- Homomorphic secret sharing from Paillier encryption (Q1616900) (← links)
- Fine-grained secure computation (Q1631318) (← links)
- Efficient rational proofs for space bounded computations (Q1675446) (← links)
- Robust threshold DSS signatures (Q1854399) (← links)
- How to sign digital streams (Q1854413) (← links)
- Paillier's trapdoor function hides up to \(O(n)\) bits (Q1865126) (← links)
- Robust and efficient sharing of RSA functions. (Q1976268) (← links)
- On the cryptographic deniability of the Signal protocol (Q2229399) (← links)
- Publicly evaluatable perceptual hashing (Q2229438) (← links)
- A new and improved paradigm for hybrid encryption secure against chosen-ciphertext attack (Q2267360) (← links)
- Using level-1 homomorphic encryption to improve threshold DSA signatures for Bitcoin wallet security (Q2303116) (← links)
- Tag-KEM/DEM: A new framework for hybrid encryption (Q2482338) (← links)
- Provably secure threshold password-authenticated key exchange (Q2507695) (← links)
- (Q2757241) (← links)
- (Q2778852) (← links)
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography (Q2790105) (← links)
- Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security (Q2822671) (← links)
- Hard-Core Predicates for a Diffie-Hellman Problem over Finite Fields (Q2849392) (← links)
- Fully Homomorphic Message Authenticators (Q2867159) (← links)
- On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption (Q2870085) (← links)
- Robust Threshold DSS Signatures (Q2876915) (← links)
- Computational Extractors and Pseudorandomness (Q2891496) (← links)
- Constructing Certificateless Encryption and ID-Based Encryption from ID-Based Key Agreement (Q3059649) (← links)
- (Q3374909) (← links)
- Robust and Efficient Sharing of RSA Functions (Q3452349) (← links)
- Sequentially Composable Rational Proofs (Q3455899) (← links)
- Secure Network Coding over the Integers (Q3562893) (← links)
- Text Search Protocols with Simulation Based Security (Q3562906) (← links)
- Okamoto-Tanaka Revisited: Fully Authenticated Diffie-Hellman with Minimal Overhead (Q3575055) (← links)
- Lower bounds on the efficiency of encryption and digital signature schemes (Q3581302) (← links)
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers (Q3582771) (← links)
- Independent Zero-Knowledge Sets (Q3591415) (← links)
- More on Key Wrapping (Q3651248) (← links)
- (Q3838773) (← links)
- (Q4249324) (← links)
- Securing threshold cryptosystems against chosen ciphertext attack (Q4249624) (← links)
- Secure Hash-and-Sign Signatures Without the Random Oracle (Q4250758) (← links)
- (Q4250769) (← links)
