0000000000429450

AUTHOR

Paolo D'arco

showing 2 related works from this author

Properties and constraints of cheating-immune secret sharing schemes

2006

AbstractA secret sharing scheme is a cryptographic protocol by means of which a dealer shares a secret among a set of participants in such a way that it can be subsequently reconstructed by certain qualified subsets. The setting we consider is the following: in a first phase, the dealer gives in a secure way a piece of information, called a share, to each participant. Then, participants belonging to a qualified subset send in a secure way their shares to a trusted party, referred to as a combiner, who computes the secret and sends it back to the participants.Cheating-immune secret sharing schemes are secret sharing schemes in the above setting where dishonest participants, during the recons…

TheoryofComputation_MISCELLANEOUSHomomorphic secret sharingCryptography0102 computer and information sciences02 engineering and technologyShared secretComputer securitycomputer.software_genre01 natural sciencesSecret sharingCheating0202 electrical engineering electronic engineering information engineeringDiscrete Mathematics and CombinatoricsSecret sharingMathematicsbusiness.industryApplied MathematicsCryptographic protocol16. Peace & justiceShamir's Secret Sharing010201 computation theory & mathematicsResilient functionsCryptographySecure multi-party computation020201 artificial intelligence & image processingVerifiable secret sharingbusinesscomputerDiscrete Applied Mathematics
researchProduct

Security of public key cryptosystems based on Chebyshev Polynomials

2004

Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptography. Moreover, they satisfy a semi-group property, which makes possible implementing a trapdoor mechanism. In this paper we study a public key cryptosystem based on such polynomials, which provides both encryption and digital signature. The cryptosystem works on real numbers and is quite efficient. Unfortunately, from our analysis it comes up that it is not secure. We describe an attack which permits to recover the corresponding plaintext from a given ciphertext. The same attack can be applied to produce forgeries …

FOS: Computer and information sciencesPlaintext-aware encryptionTheoretical computer scienceComputer Science - Cryptography and SecurityCramer–Shoup cryptosystemData_CODINGANDINFORMATIONTHEORYDeterministic encryptionHybrid cryptosystemCryptosystemElectrical and Electronic EngineeringSemantic securityThreshold cryptosystemCryptography and Security (cs.CR)Goldwasser–Micali cryptosystemMathematics
researchProduct