Sciweavers

186 search results - page 25 / 38
» Signature Schemes Based on the Strong RSA Assumption
Sort
View
CRYPTO
2010
Springer
189views Cryptology» more  CRYPTO 2010»
14 years 9 months ago
Instantiability of RSA-OAEP under Chosen-Plaintext Attack
We show that the widely deployed RSA-OAEP encryption scheme of Bellare and Rogaway (Eurocrypt 1994), which combines RSA with two rounds of an underlying Feistel network whose hash...
Eike Kiltz, Adam O'Neill, Adam Smith
CRYPTO
2005
Springer
163views Cryptology» more  CRYPTO 2005»
15 years 5 months ago
On the Generic Insecurity of the Full Domain Hash
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...
Yevgeniy Dodis, Roberto Oliveira, Krzysztof Pietrz...
ASIACRYPT
1999
Springer
15 years 4 months ago
How to Prove That a Committed Number Is Prime
Abstract. The problem of proving a number is of a given arithmetic format with some prime elements, is raised in RSA undeniable signature, group signature and many other cryptograp...
Tri Van Le, Khanh Quoc Nguyen, Vijay Varadharajan
AINA
2006
IEEE
15 years 5 months ago
Distributed Key Management for Secure Role based Messaging
Secure Role Based Messaging (SRBM) augments messaging systems with role oriented communication in a secure manner. Role occupants can sign and decrypt messages on behalf of roles....
Gansen Zhao, Sassa Otenko, David W. Chadwick
ASIACRYPT
2009
Springer
15 years 4 months ago
PSS Is Secure against Random Fault Attacks
A fault attack consists in inducing hardware malfunctions in order to recover secrets from electronic devices. One of the most famous fault attack is Bellcore’s attack against RS...
Jean-Sébastien Coron, Avradip Mandal