Sciweavers

49 search results - page 5 / 10
» A Feebly Secure Trapdoor Function
Sort
View
CTRSA
2007
Springer
146views Cryptology» more  CTRSA 2007»
15 years 6 months ago
How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature
Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most s...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang
IJACT
2008
136views more  IJACT 2008»
14 years 11 months ago
Anonymous RFID authentication supporting constant-cost key-lookup against active adversaries
: In the absence of sufficiently optimised public key constructions, anonymous authentication for Radio-Frequency Identification Devices (RFIDs) requires state synchronisation betw...
Mike Burmester, Breno de Medeiros, Rossana Motta
SCN
2008
Springer
14 years 11 months ago
Two Generic Constructions of Probabilistic Cryptosystems and Their Applications
In this paper, we build, in a generic way, two asymmetric cryptosystems with a careful study of their security. We present first an additively homomorphic scheme which generalizes,...
Guilhem Castagnos
ASIACRYPT
2009
Springer
15 years 3 months ago
Hedged Public-Key Encryption: How to Protect against Bad Randomness
Abstract. Public-key encryption schemes rely for their IND-CPA security on per-message fresh randomness. In practice, randomness may be of poor quality for a variety of reasons, le...
Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas ...
STOC
2006
ACM
120views Algorithms» more  STOC 2006»
16 years 1 days ago
Black-box constructions for secure computation
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Ere...