A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Hiding information and signatures in trapdoor knapsacks
IEEE Transactions on Information Theory
A randomized protocol for signing contracts
Communications of the ACM
A model to order the encryption algorithms according to their quality
ACM SIGCOMM Computer Communication Review
Limits on the provable consequences of one-way permutations
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Limits on the provable consequences of one-way permutations (invited talk)
CRYPTO '88 Proceedings on Advances in cryptology
On the importance of memory resources in the security of key exchange protocols (extended abstract)
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
CRYPTO '89 Proceedings on Advances in cryptology
An efficient protocol for unconditionally secure secret key exchange
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Crossroads
ACM Computing Surveys (CSUR)
Symmetric and Asymmetric Encryption
ACM Computing Surveys (CSUR)
Encryption and Secure Computer Networks
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM - Special 25th Anniversary Issue
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Secure personal computing in an insecure network
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Enabling crypto: how radical innovations occur
Communications of the ACM - Supporting community and building social capital
Fair e-Lotteries and e-Casinos
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
On the Security Properties of OAEP as an All-or-Nothing Transform
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Multiparty Secret Key Exchange Using a Random Deal of Cards
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Perfectly-Secure Key Distribution for Dynamic Conferences
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
A Certified E-mail System with Receiver's Selective Usage of Delivery Authority
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Informatics - 10 Years Back. 10 Years Ahead.
Some Open Problems In Cryptography
ACM '78 Proceedings of the 1978 annual conference
Defending Against Denial-of-Service Attacks with Puzzle Auctions
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Secure routing for structured peer-to-peer overlay networks
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Taming IP packet flooding attacks
ACM SIGCOMM Computer Communication Review
A protocol for signing contracts
ACM SIGACT News - A special issue on cryptography
Key distribution techniques for sensor networks
Wireless sensor networks
The internet public key infrastructure
IBM Systems Journal - End-to-end security
How to achieve blocking resistance for existing systems enabling anonymous web surfing
Proceedings of the 2004 ACM workshop on Privacy in the electronic society
New client puzzle outsourcing techniques for DoS resistance
Proceedings of the 11th ACM conference on Computer and communications security
Blind sales in electronic commerce
ICEC '04 Proceedings of the 6th international conference on Electronic commerce
Secure routing for structured peer-to-peer overlay networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Moderately hard, memory-bound functions
ACM Transactions on Internet Technology (TOIT)
Message authentication by integrity with public corroboration
NSPW '05 Proceedings of the 2005 workshop on New security paradigms
Cryptographic key exchange based on locationing information
Pervasive and Mobile Computing
A Light-Weight e-Voting System with Distributed Trust
Electronic Notes in Theoretical Computer Science (ENTCS)
Journal of Computer Security
Using client puzzles to protect TLS
SSYM'01 Proceedings of the 10th conference on USENIX Security Symposium - Volume 10
Using client puzzles to protect TLS
SSYM'01 Proceedings of the 10th conference on USENIX Security Symposium - Volume 10
Combinatorial design of key distribution mechanisms for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
A survey of key management schemes in wireless sensor networks
Computer Communications
TARP: Ticket-based address resolution protocol
Computer Networks: The International Journal of Computer and Telecommunications Networking
Cross-layer jamming detection and mitigation in wireless broadcast networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
ID-based cryptography using symmetric primitives
Designs, Codes and Cryptography
Securing user-controlled routing infrastructures
IEEE/ACM Transactions on Networking (TON)
Brahms: byzantine resilient random membership sampling
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
SpringSim '07 Proceedings of the 2007 spring simulation multiconference - Volume 3
A hybrid cryptosystem based on WEP for 802.11 networks
Journal of Computational Methods in Sciences and Engineering - Selected papers from the International Conference on Computer Science, Software Engineering, Information Technology, e-Business, and Applications, 2004
BAP: Broadcast Authentication Using Cryptographic Puzzles
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Brahms: Byzantine resilient random membership sampling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
International Journal of Information and Computer Security
A simple non-interactive pairwise key establishment scheme in sensor networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Security Notions and Generic Constructions for Client Puzzles
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Designated verifier proofs and their applications
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Conditional oblivious transfer and timed-release encryption
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
A survey of peer-to-peer security issues
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
Magnifying computing gaps: establishing encrypted communication over unidirectional channels
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Combating spam and denial-of-service attacks with trusted puzzle solvers
ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
Basing weak public-key cryptography on strong one-way functions
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Public-key cryptography from different assumptions
Proceedings of the forty-second ACM symposium on Theory of computing
Noninteractive pairwise key establishment for sensor networks
IEEE Transactions on Information Forensics and Security
A survey on key management mechanisms for distributed Wireless Sensor Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Algorithms and theory of computation handbook
Cryptographic transformations of non-shannon sources of information
Cybernetics and Systems Analysis
Privacy addressing and autoconfiguration for mobile ad hoc networks
Computer Communications
Cross-layer jamming detection and mitigation in wireless broadcast networks
IEEE/ACM Transactions on Networking (TON)
Time-lock puzzles in the random oracle model
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Merkle puzzles in a quantum world
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Weak oblivious transfer from strong one-way functions
ProvSec'11 Proceedings of the 5th international conference on Provable security
WiSec' 2011 poster: security enhancement for bluetooth low energy with Merkle's puzzle
ACM SIGMOBILE Mobile Computing and Communications Review
Proceedings of the 27th Annual Computer Security Applications Conference
Improved merkle cryptosystem (IMC)
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
On bluetooth repairing: key agreement based on symmetric-key cryptography
CISC'05 Proceedings of the First SKLOIS conference on Information Security and Cryptology
Mobile agents: preserving privacy and anonymity
IMTCI'04 Proceedings of the Second international conference on Intelligent Media Technology for Communicative Intelligence
Secure communications over insecure channels based on short authenticated strings
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
A secure distance-based RFID identification protocol with an off-line back-end database
Personal and Ubiquitous Computing
An evenhanded certified email system for contract signing
ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
Efficient memory bound puzzles using pattern databases
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
SPRITS: secure pedagogical resources in intelligent tutoring systems
ITS'06 Proceedings of the 8th international conference on Intelligent Tutoring Systems
Timed release cryptography from bilinear pairings using hash chains
CMS'06 Proceedings of the 10th IFIP TC-6 TC-11 international conference on Communications and Multimedia Security
Survey Secure and reliable clustering in wireless sensor networks: A critical survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Revisiting the security model for timed-release encryption with pre-open capability
ISC'07 Proceedings of the 10th international conference on Information Security
An effective secure routing for false data injection attack in wireless sensor network
APNOMS'07 Proceedings of the 10th Asia-Pacific conference on Network Operations and Management Symposium: managing next generation networks and services
Allowing continuous evaluation of citizen opinions through social networks
EGOVIS'12/EDEM'12 Proceedings of the 2012 Joint international conference on Electronic Government and the Information Systems Perspective and Electronic Democracy, and Proceedings of the 2012 Joint international conference on Advancing Democracy, Government and Governance
Authenticated data structures, generically
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Proceedings of the 5th conference on Innovations in theoretical computer science
Hi-index | 48.28 |
According to traditional conceptions of cryptographic security, it is necessary to transmit a key, by secret means, before encrypted massages can be sent securely. This paper shows that it is possible to select a key over open communications channels in such a fashion that communications security can be maintained. A method is described which forces any enemy to expend an amount of work which increases as the square of the work required of the two communicants to select the key. The method provides a logically new kind of protection against the passive eavesdropper. It suggests that further research on this topic will be highly rewarding, both in a theoretical and a practical sense.