Sciweavers

370 search results - page 16 / 74
» Limits of Constructive Security Proofs
Sort
View
COCO
2009
Springer
113views Algorithms» more  COCO 2009»
14 years 2 months ago
Are PCPs Inherent in Efficient Arguments?
Starting with Kilian (STOC ‘92), several works have shown how to use probabilistically checkable proofs (PCPs) and cryptographic primitives such as collision-resistant hashing to...
Guy N. Rothblum, Salil P. Vadhan
EUROCRYPT
2012
Springer
11 years 10 months ago
Malleable Proof Systems and Applications
sion of an extended abstract published in Proceedings of Eurocrypt 2012, Springer-Verlag, 2012. Available from the IACR Cryptology ePrint Archive as Report 2012/012. Malleability ...
Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya...
FSE
2001
Springer
85views Cryptology» more  FSE 2001»
14 years 20 days ago
New Results on the Pseudorandomness of Some Blockcipher Constructions
In this paper, we describe new results on the security, in the Luby-Rackoff paradigm, of two modified Feistel constructions, namely the L-scheme, a construction used at various l...
Henri Gilbert, Marine Minier
ACISP
2008
Springer
13 years 10 months ago
Efficient One-Round Key Exchange in the Standard Model
We consider one-round key exchange protocols secure in the standard model. The security analysis uses the powerful security model of Canetti and Krawczyk and a natural extension of...
Colin Boyd, Yvonne Cliff, Juan Manuel Gonzá...
EUROCRYPT
2007
Springer
14 years 2 days ago
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...
Yehuda Lindell, Benny Pinkas