What a lovely hat
Is it made out of
tin foil
?
International Association for Cryptologic Research
International Association
for Cryptologic Research
IACR
Events
All IACR events
Asiacrypt
Crypto
Eurocrypt
CHES
FSE
PKC
TCC
RWC
Cryptology Schools
In cooperation with IACR
Publications
All IACR Publications
Journal of Cryptology
Transactions on Symmetric Cryptology
Transactions on CHES
Communications in Cryptology
Cryptology ePrint Archive
Artifact Archive
Access IACR Publications
Museum of Historic Papers
Publication Statistics
News
All News
Awards
Elections
Petitions & Statements
Services
Jobs
CryptoDB
Calendar of Events
Videos
Members
How to Join
Update Membership Information
Access IACR Publications
Subscribe to News Updates
About
About IACR
Board of Directors
Committees
Documents
Privacy Policy
Suggestions from
local search
as you type. Hit enter to search with Google.
Search
Suggestions from
local search
as you type. Hit enter to search with Google.
CryptoDB
General
About CryptoDB
Report errors
Publications
Awards
Invited talks/papers
By year
By venue
With video
Acceptance rates
BibTeX
People
Most publications
Coauthor statistics
All Program committees
Most Program committees
Papers from Journal of Cryptology 2003
Year
Venue
Title
2003
JOFC
A Probable Prime Test with Very High Confidence for n L 3 mod 4
Siguna Müller
2003
JOFC
Buses for Anonymous Message Delivery
Amos Beimel
Shlomi Dolev
2003
JOFC
Decorrelation: A Theory for Block Cipher Security
Serge Vaudenay
2003
JOFC
Edit Probability Correlation Attacks on Stop/ Go Clocked Keystream Generators
Jovan Dj. Golic
Renato Menicocci
2003
JOFC
Efficient Amplification of the Security of Weak Pseudo-Random Function Generators
Steven Myers
2003
JOFC
Generating Random Factored Numbers, Easily
Adam Kalai
2003
JOFC
Oblivious Transfers and Privacy Amplification
Gilles Brassard
Claude Crépeau
Stefan Wolf
2003
JOFC
On the Security of Modular Exponentiation with Application to the Construction of Pseudorandom Generators
Oded Goldreich
Vered Rosen
2003
JOFC
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
Yehuda Lindell
2003
JOFC
Separating Decision Diffie-Hellman from Computational Diffie-Hellman in Cryptographic Groups
Antoine Joux
Kim Nguyen
2003
JOFC
The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme
Mihir Bellare
Chanathip Namprempre
David Pointcheval
Michael Semanko
2003
JOFC
Trading Help for Interaction in Statistical Zero-Knowledge Proofs
Michael Ben-Or
Danny Gutfreund